【C++】1075. PAT Judge (25)
来源:互联网 发布:淘宝网秋季女装套裙 编辑:程序博客网 时间:2024/05/16 17:37
1075. PAT Judge (25)
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 sametotal_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 2020 25 25 3000002 2 1200007 4 1700005 1 1900007 2 2500005 1 2000002 2 200005 1 1500001 1 1800004 3 2500002 2 2500005 3 2200006 4 -100001 2 1800002 1 2000004 1 1500002 4 1800001 3 400001 4 200005 2 -100004 2 0Sample Output:
1 00002 63 20 25 - 182 00005 42 20 0 22 -2 00007 42 - 25 - 172 00001 42 18 18 4 25 00004 40 15 0 25 -
没有全AC 拿了19分
#include<iostream>#include<vector>#include<algorithm>using namespace std;struct stu{int id;int a[5];int total;int cc;};bool cmp(stu a,stu b){if(a.total==b.total){if(a.cc==b.cc)return a.id<b.id;else return a.cc>b.cc;}elsereturn a.total>b.total;}int main(){int N,P,K;int sc[5];freopen("in.txt","r",stdin);scanf("%d%d%d",&N,&P,&K);vector<stu> s(N);vector<stu>::iterator it;int i,j;for(i=0;i<P;i++){scanf("%d",&sc[i]);}for(i=0;i<N;i++){for(j=0;j<P;j++){s[i].a[j]=-2;}s[i].total=0;s[i].cc=0;s[i].id=i+1;}while(K--){int no,pr,ss;scanf("%d%d%d",&no,&pr,&ss);no--;pr--;if(ss==-1){s[no].a[pr]=0;}if(ss>s[no].a[pr]){if(s[no].a[pr]!=-2){s[no].total-=s[no].a[pr];}s[no].a[pr]=ss;s[no].total+=s[no].a[pr];if(ss==sc[pr]){s[no].cc++;}}}sort(s.begin(),s.end(),cmp);int level=0,ttt=-1;for(it=s.begin();it!=s.end();it++){stu ss=(*it);if(ss.total>0){if(ttt!=ss.total){level=it-s.begin()+1;ttt=ss.total;}printf("%d %05d %d",level,ss.id,ttt);for(i=0;i<P;i++){if(ss.a[i]==-2){printf(" -");}else{printf(" %d",ss.a[i]);}}cout<<endl;}}return 0;}
- 【C++】1075. PAT Judge (25)
- PAT 1075. PAT Judge (25)
- PAT 1075. PAT Judge (25)
- 【PAT】1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- char,short ,int ,long,long long,unsigned long long数据范围
- 消息模式Toast.makeText的几种常见用法
- Android的2D绘图(二)
- opencv学习笔记(1)--深度解析Mat
- delphi LISTVIEW使用
- 【C++】1075. PAT Judge (25)
- 信息增益,信息增益率,Gini
- jsp不在根目录下面,struts2 action访问不到怎么办 ,解决办法
- Eclipse启动报 CreateProcess error 错误正确解决办法
- 数组的循环移位
- android自动化测试中hierarchyviewer和uiautomatorviewer获取控件信息的方式比对(2)
- 解决h264bitstream的一个bug
- kmp模板
- centos 网易yum源出错解决办法 mark