PAT 甲级 1075 PAT Judge 最后一个测试点未通过（C语言版本）

最新推荐文章于 2021-07-09 03:33:53 发布

原创

最新推荐文章于 2021-07-09 03:33:53 发布 · 737 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #oj系统 #c语言 #数据结构

本文介绍了PAT甲级1075题目的排名系统实现，涉及输入输出规格、样例及注意事项。文章指出在处理用户提交记录时，需要考虑编译失败、满分计数、分数更新等多个细节，并分享了代码实现中遇到的问题及尝试的解决方案，但最后一个测试点未能通过，期待得到帮助。

题目介绍：

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&

最低0.47元/天解锁文章