Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive number N (≤100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (≤300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.
Output Specification:
For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:
registration_number final_rank location_number local_rank
The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.
Sample Input:
2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85
结尾无空行
Sample Output:
9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4
结尾无空行
正确代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct student{
char id[16];
int score;
int local_num;
int local_rank;
}stu[30003];
bool cmp(student a,student b){
if(a.score!=b.score)
return a.score>b.score;
else
return strcmp(a.id,b.id)<0; //从小到大按学号排列
}
int main(){
int i=0,n=0,j=0,num=0,m=1;
int k[100];
scanf("%d",&n);
if(n)
while(n--){
scanf("%d",&k[i]);
for(int p=0;p<k[i];j++,p++){
scanf("%s%d",stu[j].id,&stu[j].score);
stu[j].local_num=i+1;
num++;
}
sort(stu+j-k[i],stu+j,cmp);
stu[j-k[i]].local_rank=1;
for(int p=1;p<k[i];p++){
if(stu[j-k[i]+p].score==stu[j-k[i]+p-1].score){
stu[j-k[i]+p].local_rank=stu[j-k[i]+p-1].local_rank;
m++;
}
else{
stu[j-k[i]+p].local_rank=stu[j-k[i]+p-1].local_rank+m;
m=1;
}
}
m=1;
i++;
}
sort(stu,stu+num,cmp);
printf("%d\n",num);
int p=0,q=1;
m=0;
for(;p<num-1;p++){
if(p==0){
printf("%s %d %d %d\n",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m++;
}
else if(stu[p].score==stu[p-1].score){
printf("%s %d %d %d\n",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m++;
}
else {
q+=m;
printf("%s %d %d %d\n",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m=1;
}
}
if(p==0){
printf("%s %d %d %d",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m++;
}
else if(stu[p].score==stu[p-1].score){
printf("%s %d %d %d",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m++;
}
else {
q+=m;
printf("%s %d %d %d",stu[p].id,q,stu[p].local_num,stu[p].local_rank);
m=1;
}
return 0;
}
一开始第二测试点和第四测试点始终过不了,后来发现是因为我只是根据样例考虑到了两个人成绩相同时,按学号排名,当变成三个人成绩相同时,结果错误,第三个人的排名只比前两人大一。
错误代码如下:
sort(stu+j-k[i],stu+j,cmp);
for(int p=0;p<k[i];p++){
if(p>0&&stu[j-k[i]+p].score==stu[j-k[i]+p-1].score)
stu[j-k[i]+p].local_rank=p;
else
stu[j-k[i]+p].local_rank=p+1;
}