Pat 1075 Pat Judge

最新推荐文章于 2022-01-28 15:07:47 发布

唐益莹

最新推荐文章于 2022-01-28 15:07:47 发布

阅读量186

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/weixin_44405344/article/details/88134207

本文详细介绍了一种基于用户提交的编程解决方案进行评分，并生成竞赛排名列表的算法。该算法考虑了用户提交的多个问题解决方案，选取每个问题的最高得分，并根据总分、完全解决问题的数量及用户ID对用户进行排名。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1075 PAT Judge （25 分）
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 (≤10
4
), the total number of users, K (≤5), the total number of problems, and M (≤10
5
), 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 -

#include <stdio.h>
#include <string.h>
#include <string>
#include <algorithm>
using namespace std;
const int maxN = 10001, maxK = 6, maxM = 100001;
typedef struct stu
{
	//char id[5];
	int id;
	int pNum;//完美解决的问题的数量
	int totalScore;
	int problem[6];
	int rank;
	bool flag;//用于判断是否应该输出
	stu() {
		//memset(id, 0, sizeof(id));
		fill(problem, problem + 6, -2);//-2代表未提交过，-1代表提交了没通过编译，0-9代表分数，输出
		pNum = 0;
		totalScore = 0;
		id = 0;
		flag = false;
	}
}stu;
bool cmp(struct stu a, struct stu b)
{
	if (a.totalScore != b.totalScore)
	{
		if (a.totalScore > b.totalScore)
			return true;
		else
			return false;
	}
	else if (a.pNum != b.pNum)
		return a.pNum > b.pNum;
	else if (a.flag == true && b.flag == false)//把不应该输出的都排到后面
		return true;
	else if (b.flag == true && a.flag == false)
		return false;
	else
		return a.id < b.id;

}
int main()
{
	int n, k, m;//n是用户数量，k是题目数量，m是提交数量
	stu student[10001];
	int p[maxK] = {0};
	/*ifstream infile; 
	infile.open("1.txt");*/
	scanf("%d %d %d", &n, &k, &m);
	//infile >> n >> k >> m;
	for (int i = 1; i <= k; i++)
		//infile >> p[i];
		scanf("%d", &p[i]);
	for (int i = 1; i <= n; i++)
	{
		int j = 4;
	student[i].id = i;
		
	}
	int uid, pid, score;
	for (int i = 0; i < m; i++)
	{
		//infile>> uid>> pid>>score;
		scanf("%d %d %d", &uid, &pid, &score);
		if (score > student[uid].problem[pid])
		{
			student[uid].problem[pid] = score;
			if (score == p[pid])
				student[uid].pNum++;
		}
	//	stu[uid].totalScore=
	}
	//bool flag[maxN] = { false };
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			if (student[i].problem[j] > -1)
			{
				student[i].flag = true;
				student[i].totalScore += student[i].problem[j];
			}
				
		}
	}
	sort(student+1, student + n+1, cmp);
	printf("1 %05d %d ", student[1].id, student[1].totalScore);
	for (int j = 1; j < k; j++)
	{
		if (student[1].problem[j] == -2)
			printf("- ");
		else if (student[1].problem[j] == -1)
			printf("0 ");
		else
			printf("%d ", student[1].problem[j]);
	}
	if (student[1].problem[k] == -2)//最后的一个题目的分数后面不应该有空格
		printf("-");
	else if (student[1].problem[k] == -1)
		printf("0");
	else
		printf("%d", student[1].problem[k]);
	printf("\n");
	int rank = 1;//排名
	for (int i = 2; i <= n; i++)
	{
		if (student[i].flag == false)
			continue;
		if (student[i].totalScore != student[i - 1].totalScore)
			rank=i;
			printf("%d %05d %d ",rank,student[i].id, student[i].totalScore);
			for (int j = 1; j < k; j++)
			{
				if (student[i].problem[j] == -2)
					printf("- ");
				else if(student[i].problem[j] == -1)
					printf("0 ");
				else
					printf("%d ", student[i].problem[j]);
			}
			if (student[i].problem[k] == -2)//最后一个题目分数后面不应该有空格
				printf("-");
			else if (student[i].problem[k] == -1)//-1当做0输出
				printf("0");
			else
				printf("%d", student[i].problem[k]);
			printf("\n");
	}
	return 0;
}