PAT 1075. PAT Judge (25)
2015-09-01 16:45
281 查看
1075. PAT Judge (25)
时间限制200 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
The ranklist of PAT is generated from the status list, which shows the scores of the submittions. 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 submittions. 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), where p[i] corresponds to the full mark of the
i-th problem. Then M lines follow, each gives the information of a submittion in the following format:
user_id problem_id partial_score_obtained
where partial_score_obtained is either -1 if the submittion 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 the total_score, and all the users with the same total_score obtain the same rank; and s[i] is the partial score obtained for the i-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 -
这道题就是对输入数据进行处理然后按要求排序,最后按要求输出即可。需要注意的是,即使某人的提交无法通过编译,那么他在这道题的得分也应当是0并且要输出。
代码如下:
#include <iostream> #include <algorithm> #include <vector> #include <iomanip> #include <cstring> using namespace std; int fullscore[6]; typedef struct user{ int perfect; int score[6]; int id; int total; int judge; user(){ for(int i=0;i<6;i++) score[i]=-1; perfect=0; total=0; judge=0; } }user; int N,K,M; vector<user> lists; bool cmp(user a,user b) { if(a.total!=b.total) return a.total>b.total; else if(a.perfect!=b.perfect) return a.perfect>b.perfect; else if(a.judge!=b.judge) return a.judge>b.judge; else return a.id<b.id; } int main(void) { int i; cin>>N>>K>>M; for(i=1;i<=K;i++) cin>>fullscore[i]; lists.resize(N+1); for(i=1;i<=N;i++) lists[i].id=i; while(M--) { int id,problem,score; cin>>id>>problem>>score; if(score<=0) { if(lists[id].score[problem]<=0) lists[id].score[problem]=0; if(score==0) lists[id].judge=1; continue; } else if(score>lists[id].score[problem]) { lists[id].total+=(score-lists[id].score[problem]); if(lists[id].score[problem]==-1) lists[id].total--; lists[id].score[problem]=score; if(score==fullscore[problem]) lists[id].perfect++; lists[id].judge=1; } } sort(lists.begin(),lists.end(),cmp); int last=99999; int rank=0,count=1; for(i=0;i<lists.size();i++) { int j; if(lists[i].judge==0) break; if(lists[i].total<last) { last=lists[i].total; rank+=count; count=1; } else count++; cout<<rank<<" "<<setw(5)<<setfill('0')<<lists[i].id<<" "; cout<<lists[i].total<<" "; for(j=1;j<K;j++) { if(lists[i].score[j]>=0) cout<<lists[i].score[j]<<" "; else cout<<"- "; } if(lists[i].score[K]>=0) cout<<lists[i].score[K]<<endl; else cout<<"-"<<endl; } }
相关文章推荐
- park入门实战系列--6.SparkSQL(下)--Spark实战应用
- #include<list>
- Android笔记(十三)AsyncTask(一)
- mac os x 添加自定义字体库
- handlebars-----另一种help的写法
- 萤石A1互联网报警盒子破解细节分析
- web.xml中的url-pattern映射规则
- 关于squirrel的那些事
- Compress--- The input point cloud
- 浅谈深度学习(Deep Learning)的基本思想和方法
- hdu 2899 Strange fuction 三分
- Ext错误"Uncaught SyntaxError: Unexpected token <"
- 提高mysql的写入效率
- 大话设计模式笔记 策略模式
- 问题:oracle CLOB类型;结果:oracle中Blob和Clob类型的区别
- iscsi 华为存储配置 上课内容
- 你在过度测试你的软件吗?
- Nouveau源码分析(零)
- JSP - Directives
- POJ1840——哈希——Eqs