本文详细解析了ACM竞赛中的计分规则，并通过一个具体示例展示了如何实现这一计分系统的算法流程。包括了如何处理多次提交、正确识别有效成绩及最终排名的计算方法。
ACM Rank Table
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 3023 | Accepted: 773 |
Description
ACM contests, like the one you are participating in, are hosted by the special software. That software, among other functions, preforms a job of accepting and evaluating teams' solutions (runs), and displaying results in a rank table. The scoring rules are as follows:
Your task is, given the list of N runs with submission time and result of each run, compute the rank table for C teams.
- Each run is either accepted or rejected.
- The problem is considered solved by the team, if one of the runs submitted for it is accepted.
- The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submission of the first accepted run for this problem (in minutes) plus 20 minutes for every other run for this problem before the accepted one. For an unsolved problem consumed time is not computed.
- The total time is the sum of the time consumed for each problem solved.
- Teams are ranked according to the number of solved problems. Teams that solve the same number of problems are ranked by the least total time.
- While the time shown is in minutes, the actual time is measured to the precision of 1 second, and the the seconds are taken into account when ranking teams.
- Teams with equal rank according to the above rules must be sorted by increasing team number.
Your task is, given the list of N runs with submission time and result of each run, compute the rank table for C teams.
Input
Input contains integer numbers C N, followed by N quartets of integes ci pi ti ri, where ci -- team number, pi -- problem number, ti -- submission time in seconds, ri -- 1, if the run was accepted, 0 otherwise.
1 ≤ C, N ≤ 1000, 1 ≤ ci ≤ C, 1 ≤ pi ≤ 20, 1 ≤ ti ≤ 36000.
1 ≤ C, N ≤ 1000, 1 ≤ ci ≤ C, 1 ≤ pi ≤ 20, 1 ≤ ti ≤ 36000.
Output
Output must contain C integers -- team numbers sorted by rank.
Sample Input
3 3 1 2 3000 0 1 2 3100 1 2 1 4200 1
Sample Output
2 1 3
Source
Northeastern Europe 2004, Far-Eastern Subregion
看到这个题我就想笑，本来在下面做了两天也没做出来，一直是WA，今天一做就出来了，真是困境出代码啊，
其实这个题很容易理解，就是对做题情况进行排序，但是数据很变态，导致很多的代码都过不去，这里提醒几点：1、输入数据可能不是按照时间提交的。
2、输入数据可能有提交AC后再次提交的，程序要能识别并加以忽略。
3、没做对的题的时间可是不加在总时间里面哦！
所以，只要把输入数据按照时间拍一下序，然后再进行计算，这样就大大减小了出错的可能了，代码和数据：
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct score{
}stu[1008];
struct node{
}lnode[1008];
int cmp1(const void *a,const void *b)
{
}
int cmp2(const void *a,const void *b)
{
}
int main()
{
}
数据：
4 3
1 2 333 0
2 5 2 1
4 2 56 1
2 4 1 3
3 4
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
2
3 7
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
3 1 1900 1
3 1 1200 0
3 1 1300 0
2 1 3
3 7
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
3 1 1900 1
3 1 1200 0
3 2 1300 0
3 2 1
3 5
1 2 1000 0
1 2 3200 1
2 1 4200 1
1 1 5100 1
2 2 5100 1
2 1 3
1000 2
1000 20 36000 1
1
1 1000 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
2 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
看到这个题我就想笑，本来在下面做了两天也没做出来，一直是WA，今天一做就出来了，真是困境出代码啊，
其实这个题很容易理解，就是对做题情况进行排序，但是数据很变态，导致很多的代码都过不去，这里提醒几点：1、输入数据可能不是按照时间提交的。
2、输入数据可能有提交AC后再次提交的，程序要能识别并加以忽略。
3、没做对的题的时间可是不加在总时间里面哦！
所以，只要把输入数据按照时间拍一下序，然后再进行计算，这样就大大减小了出错的可能了，代码和数据：
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct score{
}stu[1008];
struct node{
}lnode[1008];
int cmp1(const void *a,const void *b)
{
}
int cmp2(const void *a,const void *b)
{
}
int main()
{
}
数据：
4 3
1 2 333 0
2 5 2 1
4 2 56 1
2 4 1 3
3 4
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
2
3 7
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
3 1 1900 1
3 1 1200 0
3 1 1300 0
2 1 3
3 7
1 2 3000 0
1 2 3100 1
2 1 4200 1
2 2 2100 0
3 1 1900 1
3 1 1200 0
3 2 1300 0
3 2 1
3 5
1 2 1000 0
1 2 3200 1
2 1 4200 1
1 1 5100 1
2 2 5100 1
2 1 3
1000 2
1000 20 36000 1
1
1 1000 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
2 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
扫一扫
205
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
