PAT甲级真题 1075 PAT Judge (25分) C++实现（map+vector统计筛选排序，注意坑点）

题目

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 -

思路

建立结构体存储得分信息：

struct User{
   
    int id;
    int total;  //总分
    int perfect;  //满分数
    vector<int> score;  //各题分数，-2:未提交过 -1:提交未通过
};

将score的初始值均设为-2，这样由score的值可知：
-2：未提交过；
-1：提交但未通过；
大于0：提交且通过；

用map存储每个id号对应的得分信息。

读入一个id某题的成绩后，
若map中没有改id则先初始化它的值：所有成绩记为-2。
若当前成绩 > 原始成绩，则将成绩更新为当前成绩；
若本次更新后成绩达到了满分，则将满分个数+1（重复得到满分只应计算1次）。

然后检查map中每个用户，若所有分数< 0，则不输出该用户； 若有一门分数 >= 0，则输出该用户，将其加入待输出vector中。

对vector按规则排序，按规则输出：
若分数==-2，则输出’-’；
若分数==-1，则输出’0’；
若分数>=0，则直接输出。

需要小心的坑点：
1、某题重复得到满分只应计算一次；
2、分数 = -1有其特殊意义，不能作为分数默认值，也不能直接计为0。得0分代表提交通过了，应该输出该用户；得-1分代表提交了但未通过，将来在成绩统计中要视为0分，而不是’-’；所以应该设置一个额外的默认分数比如-2。

代码

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm&g