未完成-PAT甲级练习1075. PAT Judge (25)

1075. PAT Judge (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

The ranklist of PAT is generated from the status list, which shows the scores of the submittions. 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⁴), the total number of users, K (<=5), the total number of problems, and M (<=10⁵), the total number of submittions. 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 submittion in the following format:

user_id problem_id partial_score_obtained

where partial_score_obtained is either -1 if the submittion 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 2020 25 25 3000002 2 1200007 4 1700005 1 1900007 2 2500005 1 2000002 2 200005 1 1500001 1 1800004 3 2500002 2 2500005 3 2200006 4 -100001 2 1800002 1 2000004 1 1500002 4 1800001 3 400001 4 200005 2 -100004 2 0

Sample Output:

1 00002 63 20 25 - 182 00005 42 20 0 22 -2 00007 42 - 25 - 172 00001 42 18 18 4 25 00004 40 15 0 25 -

这题我一开始以为只有四门课，结果导致我现在的结构体建错了，修改有点复杂，先放弃了，这里转载一下别人的程序，思路差不多

分析：结构体数组中passnum统计完整通过的题目个数，isshown在用户有一题通过了编译器（不管得不得0分）的时候置为true。vector<int> score;记录每门课的最高分
因为没有通过编译器的分数为0，但是没有提交过的分数为“-”，所以把有一门课每次都是未通过编译器的那门课分数置为-2。初始化数组分数为-1，所以可以根据-1和-2判断当前分数是提交过了没通过编译器的，还是没提交过的题目。
注意：因为最后一个测试样例是有一个人一开始得到了分数，后来提交了一次没有通过编译器的，所以要判断在分数每次更新最大值之后if(v[id].score[num] == -1)，说明最好成绩只是-1（也就是没通过编译器或者没有提交过），这个时候再置v[id].score[num] = -2，否则会误操作把已经提交过很好分数的人的成绩抹掉成了-2

先贴上我自己的程序

#include <iostream>  #include <cstdio>  #include <algorithm>  #include <vector>  #include <map>  #include <set>  #include <stack>  #include <queue>  #include <string>  #include <string.h> using namespace std;const int MAX = 1e4+10;int indexx[MAX], cnt;struct usr{usr():g[1](-2),g[2](-2),g[3](-2),g[4](-2), tg(0){}int id;int g[6];int tg;int f[6];int flag, ncflag;};bool cmp(usr a, usr b){if(a.flag==b.flag==1){if(a.tg==b.tg){return a.f[1]==b.f[1] ? a.f[2]==b.f[2] ? a.f[3]==b.f[3] ? a.f[4]==b.f[4] ? a.id<b.id : a.f[4]>b.f[4] : a.f[3]>b.f[3] : a.f[2]>b.f[2] : a.f[1]>b.f[1];}elsereturn a.tg > b.tg;}elsereturn a.flag > b.flag;}int main() {int n, pn, sn, fm[5];scanf("%d%d%d", &n, &pn, &sn);scanf("%d%d%d%d", &fm[1], &fm[2], &fm[3], &fm[4]);vector<usr> v(n+1);for(int i=0; i<sn; i++){int id, pid, s;scanf("%d%d%d", &id, &pid, &s);if(!indexx[id]) indexx[id]=++cnt, v[indexx[id]].id = id;if(s==fm[pid]) v[indexx[id]].f[pid]=1;switch(pid){case 1:if(s>v[indexx[id]].g1){if(s<0) v[indexx[id]].ncflag=1;v[indexx[id]].g1 = s;   }   break;case 2:if(s>v[indexx[id]].g2){if(s<0) v[indexx[id]].ncflag=1;v[indexx[id]].g2 = s;   }   break;case 3:if(s>v[indexx[id]].g3){if(s<0) v[indexx[id]].ncflag=1;v[indexx[id]].g3 = s;   }   break;case 4:if(s>v[indexx[id]].g4){if(s<0) v[indexx[id]].ncflag=1;v[indexx[id]].g4 = s;   }   break;}}for(int i=1; i<v.size(); i++){if(v[i].g1>=0) v[i].tg += v[i].g1, v[i].flag=1;else if(v[i].g1==-1) v[i].g1=0;if(v[i].g2>=0) v[i].tg += v[i].g2, v[i].flag=1;else if(v[i].g2==-1) v[i].g2=0;if(v[i].g3>=0) v[i].tg += v[i].g3, v[i].flag=1;else if(v[i].g3==-1) v[i].g3=0;if(v[i].g4>=0) v[i].tg += v[i].g4, v[i].flag=1;else if(v[i].g4==-1) v[i].g4=0;}sort(v.begin()+1, v.end(), cmp);int tempr=0, r=0, tempg=fm[1]+fm[2]+fm[3]+fm[4]+1;for(int i=1; i<v.size(); i++){if(v[i].flag==1){if(v[i].tg<tempg) tempg = v[i].tg, tempr++, r=tempr;else if (v[i].tg==tempg) tempr++; printf("%d %05d %d", r, v[i].id, v[i].tg);v[i].g1>-2 ? printf(" %d", v[i].g1) : printf(" -");v[i].g2>-2 ? printf(" %d", v[i].g2) : printf(" -");v[i].g3>-2 ? printf(" %d", v[i].g3) : printf(" -");v[i].g4>-2 ? printf(" %d", v[i].g4) : printf(" -");printf("\n");}}scanf("%d",&n);    return 0;}

再贴上AC的

#include <cstdio>#include <vector>#include <algorithm>using namespace std;struct node {    int rank, id, total = 0;    vector<int> score;    int passnum = 0;    bool isshown = false;};bool cmp1(node a, node b) {    if(a.total != b.total)        return a.total > b.total;    else if(a.passnum != b.passnum)        return a.passnum > b.passnum;    else        return a.id < b.id;} int main() {    int n, k, m, id, num, score;    scanf("%d %d %d", &n, &k, &m);    vector<node> v(n + 1);    for(int i = 1; i <= n; i++)        v[i].score.resize(k + 1, -1);    vector<int> full(k + 1);    for(int i = 1; i <= k; i++)        scanf("%d", &full[i]);    for(int i = 0; i < m; i++) {        scanf("%d %d %d", &id, &num, &score);        v[id].id = id;        v[id].score[num] = max(v[id].score[num], score);        if(score != -1)            v[id].isshown = true;        else if(v[id].score[num] == -1)            v[id].score[num] = -2;    }    for(int i = 1; i <= n; i++) {        for(int j = 1; j <= k; j++) {            if(v[i].score[j] != -1 && v[i].score[j] != -2)                v[i].total += v[i].score[j];            if(v[i].score[j] == full[j])                v[i].passnum++;        }    }    sort(v.begin() + 1, v.end(), cmp1);    for(int i = 1; i <= n; i++) {        v[i].rank = i;        if(i != 1 && v[i].total == v[i - 1].total)            v[i].rank = v[i - 1].rank;    }    for(int i = 1; i <= n; i++) {        if(v[i].isshown == true) {            printf("%d %05d %d", v[i].rank, v[i].id, v[i].total);            for(int j = 1; j <= k; j++) {                if(v[i].score[j] != -1 && v[i].score[j] != -2)                    printf(" %d", v[i].score[j]);                else if(v[i].score[j] == -1)                    printf(" -");                else                    printf(" 0");            }            printf("\n");        }    }    return 0;}