)
The ranklist of PAT is generated from the status list, which shows the scores of the submissions. This time you are supposed to generate the ranklist for PAT.
Input Specification:
Each input file contains one test case. For each case, the first line contains 3 positive integers, N (≤104), the total number of users, K (≤5), the total number of problems, and M (≤105), the total number of submissions. It is then assumed that the user id's are 5-digit numbers from 00001 to N, and the problem id's are from 1 to K. The next line contains K positive integers
p[i]
(i
=1, ..., K), wherep[i]
corresponds to the full mark of the i-th problem. Then M lines follow, each gives the information of a submission in the following format:user_id problem_id partial_score_obtained
where
partial_score_obtained
is either −1 if the submission cannot even pass the compiler, or is an integer in the range [0,p[problem_id]
]. All the numbers in a line are separated by a space.Output Specification:
For each test case, you are supposed to output the ranklist in the following format:
rank user_id total_score s[1] ... s[K]
where
rank
is calculated according to thetotal_score
, and all the users with the sametotal_score
obtain the samerank
; ands[i]
is the partial score obtained for thei
-th problem. If a user has never submitted a solution for a problem, then "-" must be printed at the corresponding position. If a user has submitted several solutions to solve one problem, then the highest score will be counted.The ranklist must be printed in non-decreasing order of the ranks. For those who have the same rank, users must be sorted in nonincreasing order according to the number of perfectly solved problems. And if there is still a tie, then they must be printed in increasing order of their id's. For those who has never submitted any solution that can pass the compiler, or has never submitted any solution, they must NOT be shown on the ranklist. It is guaranteed that at least one user can be shown on the ranklist.
Sample Input:
7 4 20 20 25 25 30 00002 2 12 00007 4 17 00005 1 19 00007 2 25 00005 1 20 00002 2 2 00005 1 15 00001 1 18 00004 3 25 00002 2 25 00005 3 22 00006 4 -1 00001 2 18 00002 1 20 00004 1 15 00002 4 18 00001 3 4 00001 4 2 00005 2 -1 00004 2 0
Sample Output:
1 00002 63 20 25 - 18 2 00005 42 20 0 22 - 2 00007 42 - 25 - 17 2 00001 42 18 18 4 2 5 00004 40 15 0 25 -
作者: CHEN, Yue
单位: 浙江大学
时间限制: 200 ms
内存限制: 64 MB
代码长度限制: 16 KB
具体解释写在代码里很清楚了。
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
typedef struct{
int id;
int s[6] = {-9,-9,-9,-9,-9,-9};//每道题的初始得分,初始化的时候随便弄个负数就好,但是不要是-1,-1后面不好区分
int total_score = 0;
int cnt_full_mark = 0;
int rank = 0;
int flag = 0;//判断这个人有没有得分为正的有效得分
int max_score[6] = {-9,-9,-9,-9,-9,-9};
} node;
node a[10005];
bool cmp(node x,node y)
{
if(x.total_score > y.total_score)
return true;
else if(x.total_score == y.total_score)
{
if(x.cnt_full_mark > y.cnt_full_mark)
return true;
else if(x.cnt_full_mark == y.cnt_full_mark)
{
if(x.id < y.id)
return true;
}
}
return false;
}
int main()
{
int full_mark[6];
int n,k,m,pnum,y,c;
cin>>n>>k>>m;
for(int i = 1;i <= k;i++)
{
cin>>full_mark[i];
}
for(int i = 0 ; i < m;i++)
{
cin>>c;//注意!这里要hash一下,因为会有同一个人不同题目的提交 和 同一个人同一道题的提交
a[c].id = c;
cin>>pnum>>y;
if(y > a[c].max_score[pnum])
a[c].max_score[pnum] = y;
a[c].s[pnum] = a[c].max_score[pnum];//每道题目的得分,取多次提交中的最高分
}
for(int i = 1; i <= n;i++)
{
for(int j = 1;j <= k;j++)
{
if(a[i].s[j] >= 0)
{
a[i].total_score += a[i].s[j];//计算总分不要放在上面那个输入的循环里面,因为求sum只要加最高的得分就行,如果三次提交得分为2-12-25的话,他会把2和12也加进去
a[i].flag = 1;
}
if(a[i].s[j] == full_mark[j])
a[i].cnt_full_mark ++;
}
}
for(int i = 1; i <= n;i++)
{
for(int j = 1;j <= k;j++)
{
if(a[i].flag == 1)//如果他的提交中有得分为正的题目,那么他其他得分为-1的题目显示得分为0
{
if(a[i].s[j] == -1)
a[i].s[j] = 0;
}
}
}
sort(a + 1,a + n + 1,cmp);
for(int i = 1;i <= n;i++)
{
if(a[i].total_score != a[i - 1].total_score)
a[i].rank = i;
else
a[i].rank = a[i - 1].rank;
}
for(int i = 1;i <= n;i++)
{
if(a[i].flag)
{
printf("%d %05d %d",a[i].rank,a[i].id,a[i].total_score);
for(int j = 1;j <= k;j++)
{
if(a[i].s[j] >= 0)
printf(" %d",a[i].s[j]);
else
printf(" -");
}
printf("\n");
}
}
return 0;
}
【一点感悟】
这道题一口气写下来,没看任何题解,中间出了很多小问题也都自己解决了。啊!!我简直是天才!我有在慢慢的进步耶!很棒棒的感觉!很开心~