PAT 1075. PAT Judge (排序,比较烦)
来源:互联网 发布:c语言输入英文 编辑:程序博客网 时间:2024/06/06 12:40
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 -
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int N =1e4+100;struct node{int name;int score[11];int ac;int sum;int ok;}a[N];int f[11];bool cmp(node t1,node t2){if(t1.sum!=t2.sum) return t1.sum>t2.sum;else if(t1.ac!=t2.ac) return t1.ac>t2.ac;return t1.name<t2.name;}int main(){int n,k,m,i,j;int name,id,score;scanf("%d%d%d",&n,&k,&m);for(i=1;i<=k;i++) scanf("%d",&f[i]);for(i=1;i<=n;i++) { for(j=1;j<=k;j++) a[i].score[j]=-1;}while(m--) {scanf("%d%d%d",&name,&id,&score); a[name].name=name; if(score>=0) a[name].ok=1; if(score>a[name].score[id] && score==f[id]) a[name].ac++;a[name].score[id]=max(max(a[name].score[id],score),0);}for(i=1;i<=n;i++) { for(j=1;j<=k;j++) a[i].sum+=max(0,a[i].score[j]);}sort(a+1,a+1+n,cmp);int Rank=1;printf("%d %05d %d",Rank,a[1].name,a[1].sum);for(j=1;j<=k;j++) {if(a[1].score[j]<0) printf(" -");else printf(" %d",a[1].score[j]);}printf("\n");for(i=2;i<=n;i++) {if(a[i].sum==0) break;if(a[i].sum!=a[i-1].sum) Rank=i;printf("%d %05d %d",Rank,a[i].name,a[i].sum);for(j=1;j<=k;j++) { if(a[i].score[j]<0) printf(" -"); else printf(" %d",a[i].score[j]); } printf("\n");}Rank++;for(;i<=n;i++) {if(!a[i].ok) continue;printf("%d %05d %d",Rank,a[i].name,a[i].sum);for(j=1;j<=k;j++) { if(a[i].score[j]<0) printf(" -"); else printf(" %d",a[i].score[j]); } printf("\n");}return 0;}
- PAT 1075. PAT Judge (排序,比较烦)
- 1075. PAT Judge (25)-排序(难)
- PAT-A1075. PAT Judge (25)(排序)
- PAT 1075. PAT Judge
- PAT-1075. PAT Judge
- 【PAT】1075. PAT Judge
- PAT--1075. PAT Judge
- PAT 1075. PAT Judge (25)(pat排名)(待修改)
- PAT 1075. PAT Judge (25) 多重排序。已解决
- PAT 1075. PAT Judge (25)
- PAT 1075. PAT Judge (25)
- 【PAT】1075. PAT Judge (25)
- 1075. PAT Judge
- 1075. PAT Judge
- 1075. PAT Judge (25)
- 1075. PAT Judge (25)
- 1075.PAT Judge
- 1075. PAT Judge (25)
- 机房收费系统---软件需求说明书
- 重学多线程开发,学习并发思路
- VS2013常用快捷键
- nginx+php+mysql+yaf+git服务器搭建记录
- cassandra 3.x官方文档(3)---gossip通信协议及故障检测与恢复
- PAT 1075. PAT Judge (排序,比较烦)
- 11.日期和时间
- ZIGBEE中Profile、Cluster和Attribute关系
- 开始学习ThinkPHP了,这学期熟悉3.2,下学期开始5.0
- 程序员技术
- HZNU2016年校赛 J.Lakes in HZNU[DFS]
- NYOJ-20 吝啬的国度
- Forward-backward algorithm
- pro文件-Qt Pro文件编写相关