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), where p[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 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 -
解题方法
这道题目从解决上来说难度不大，主要是一些细节的处理
易错点：
- 学生ID是从1开始的，所以在开数组的时候要为N+1
- 不展示的在排行榜上的是那些没有一题编译通过或者一题都没交的，但是如果交了是0，还是需要体现在排行榜上的。
- 排名在计算时，如果跟前面成绩相同，排名就为前面的同学，如果不同，不能简单以前面同学加一作为输出
AC代码
直接排序
/*
* @Coding: GB2312
* @Author: Hongrry
* @Date: 2020-11-21 11:47:47
* @Last Modified: 2020-11-21 21:40:27
*/
#include <stdio.h>
#include <stdlib.h>
#define MAX_PROBLEMS_NUM 6
#define MAX_ID_NUM 10001
//储存数据的结构体
typedef struct node
{
int id; //学生id
int totalScore=0; //初始化总分数为0
int partialScore[MAX_PROBLEMS_NUM]={-1,-1,-1,-1,-1,-1}; //初始化每个题的分数
int flag=0; //标记最后是否输出
int rank; //位次
int totaln; //满分数
}Student;
Student Students[MAX_ID_NUM]; //位次表
int fullScore[MAX_PROBLEMS_NUM]; //题目的最高分
//初始化数据
void InitRankList(int N,int K,int M)
{
int userId,problemId,score;
//每个题的最高分
for (int i = 1; i <= K; i++)
scanf("%d",&fullScore[i]);
//读入数据
for (int i = 0; i < M; i++)
{
scanf("%d %d %d",&userId,&problemId,&score);
Students[userId].id=userId;
if (score>=Students[userId].partialScore[problemId])
{//如果得分更高，更新分数
if (score==-1)
{ //提交了，但是没有编译通过
Students[userId].partialScore[problemId]=0;
}else
{ //编译通过
Students[userId].partialScore[problemId]=score;
Students[userId].flag=1; //编译通过，最后需要输出
}
}
}
}
//计算满分个数
int GetPerfect(Student a,int K)
{
int count=0;
for (int i = 1; i <= K; i++)
if (a.partialScore[i]==fullScore[i])
count++;
return count;
}
//计算总分
void CountTotalScore(int N,int K)
{
for (int i = 1; i <= N; i++)
{
Students[i].totaln=GetPerfect(Students[i],K); //计算满分个数
for (int j = 1; j<= K; j++)
{
if (Students[i].partialScore[j]>0)
Students[i].totalScore+=Students[i].partialScore[j];
}
}
}
//输出
void MyPrint(int N,int K)
{
for (int i = 1; i <= N; i++)
{
if (Students[i].flag==1)
{
printf("%d %05d %d",Students[i].rank,Students[i].id,Students[i].totalScore);
for (int j = 1; j <= K; j++)
{
if (Students[i].partialScore[j]>=0)
printf(" %d",Students[i].partialScore[j]);
else
printf(" -");
}
printf("\n");
}
}
}
//比较
int compar(const void *p1, const void *p2)
{
Student * a=(Student *)p1;
Student * b=(Student *)p2;
if ((a->totalScore>b->totalScore)||
(a->totalScore==b->totalScore&&a->totaln>b->totaln)||
(a->totalScore==b->totalScore&&a->totaln==b->totaln&&a->id<b->id))
{
return -1;
}else
return 1;
}
//计算位次
void ranked(int N)
{
for (int i = 1; i <= N; i++)
{
if (Students[i].totalScore==Students[i-1].totalScore)
{
Students[i].rank=Students[i-1].rank;
}else
{
Students[i].rank=i;
}
}
}
int main()
{
int N,K,M;
scanf("%d %d %d",&N,&K,&M);
InitRankList(N,K,M);
CountTotalScore(N,K);
qsort(Students+1,N,sizeof(Student),compar);
ranked(N);
MyPrint(N,K);
return 0;
}
表排序
/*
* @Coding: GB2312
* @Author: Hongrry
* @Date: 2020-11-21 11:47:47
* @Last Modified: .
*/
#include <stdio.h>
#include <stdlib.h>
#define MAX_PROBLEMS_NUM 6
#define MAX_ID_NUM 10001
//储存数据的结构体
typedef struct node
{
int id; //学生id
int totalScore=0; //初始化总分数为0
int partialScore[MAX_PROBLEMS_NUM]={-1,-1,-1,-1,-1,-1}; //初始化每个题的分数
int flag=0; //标记最后是否输出
int rank; //位次
int total; //满分数
}Student;
Student Students[MAX_ID_NUM]; //位次表
int fullScore[MAX_PROBLEMS_NUM]; //题目的最高分
//初始化数据
void InitRankList(int N,int K,int M)
{
int userId,problemId,score;
//每个题的满分
for (int i = 1; i <= K; i++)
{
scanf("%d",&fullScore[i]);
}
//读入数据
for (int i = 0; i < M; i++)
{
scanf("%d %d %d",&userId,&problemId,&score);
if (score>=Students[userId].partialScore[problemId])
{
if (score==-1)
{
//提交了，但是没有编译通过
Students[userId].partialScore[problemId]=0;
}else
{
//编译通过
Students[userId].partialScore[problemId]=score;
Students[userId].flag=1;
}
}
}
}
int GetPerfectNum(int id,int K)
{
int count=0;
for (int i = 1; i <= K; i++)
{
if (Students[id].partialScore[i]==fullScore[i])
count++;
}
return count;
}
void CountTotalScore(int N,int K)
{
for (int i = 1; i <= N; i++)
{
Students[i].total=GetPerfectNum(i,K);
for (int j = 1; j<= K; j++)
{
if (Students[i].partialScore[j]>0)
Students[i].totalScore+=Students[i].partialScore[j];
}
}
}
void sort(int N,int K,int Table[])
{
//初始化表
for (int i = 1; i <= N; i++)
{
Table[i]=i;
}
//插入排序
for (int i = 2; i <= N; i++)
{
int j=i;
int temp=Table[i];
while (j>1)
{
if (Students[Table[j-1]].totalScore<Students[temp].totalScore)
{
Table[j]=Table[j-1];
j--;
}else if (Students[Table[j-1]].totalScore==Students[temp].totalScore)
{
Students[temp].rank=j;
if (Students[Table[j-1]].total<Students[temp].total)
{
Table[j]=Table[j-1];
j--;
}else
break;
}else
break;
}
Table[j]=temp;
}
//计算位次
for (int i = 1; i <=N; i++)
{
if (Students[Table[i]].totalScore==Students[Table[i-1]].totalScore)
{
Students[Table[i]].rank=Students[Table[i-1]].rank;
}else
{
Students[Table[i]].rank=i;
}
}
}
void MyPrint(int N,int K,int Table[])
{
int flag=1;
for (int i = 1; i <= N; i++)
{
if (Students[Table[i]].flag==1)
{
printf("%d %05d %d",Students[Table[i]].rank,Table[i],Students[Table[i]].totalScore);
flag=0;
for (int j = 1; j <= K; j++)
{
if (Students[Table[i]].partialScore[j]>=0)
printf(" %d",Students[Table[i]].partialScore[j]);
else
printf(" -");
}
printf("\n");
}
}
}
int main()
{
int Table[MAX_ID_NUM];
int N,K,M;
scanf("%d %d %d",&N,&K,&M);
InitRankList(N,K,M);
CountTotalScore(N,K);
sort(N,K,Table);
MyPrint(N,K,Table);
return 0;
}
827
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
