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 (<=104), the total number of users, K (<=5), the total number of problems, and M (<=105), 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 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<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct infoStruct{
int id;
int prob[];
int perfect;
int full;
int rank;
int shown;
infoStruct(){
perfect = ;
shown = ;
for(int i = ; i < ; i++)
prob[i] = -;
}
}info;
bool cmp(info a, info b){
if(a.full != b.full)
return a.full > b.full;
else if(a.perfect != b.perfect)
return a.perfect > b.perfect;
else return a.id < b.id;
}
info user[];
int main(){
int N, K, M, fullSco[];
int tempPro, tempSco, id;
scanf("%d%d%d", &N, &K, &M);
for(int i = ; i <= K; i++)
scanf("%d", &fullSco[i]);
for(int i = ; i <= N; i++)
user[i].id = i;
for(int i = ; i < M; i++){
scanf("%d%d%d", &id, &tempPro, &tempSco);
if(tempSco == fullSco[tempPro] && user[id].prob[tempPro] != fullSco[tempPro])
user[id].perfect++;
if(user[id].prob[tempPro] < tempSco){
user[id].prob[tempPro] = tempSco;
if(tempSco >= )
user[id].shown = ;
}
}
for(int i = ; i <= N; i++){
int ans = ;
for(int j = ; j <= K; j++){
if(user[i].prob[j] > )
ans += user[i].prob[j];
}
user[i].full = ans;
}
sort(user + , user + (N + ), cmp);
user[].rank = ;
for(int i = ; i <= N; i++){
if(user[i].full == user[i - ].full)
user[i].rank = user[i - ].rank;
else user[i].rank = i;
}
for(int i = ; i <= N; i++){
if(user[i].shown == ){
printf("%d %05d %d", user[i].rank, user[i].id, user[i].full);
for(int j = ; j <= K; j++){
if(user[i].prob[j] == -)
printf("");
else if(user[i].prob[j] == -)
printf(" -");
else printf(" %d", user[i].prob[j]);
}
printf("\n");
}
}
cin >> K;
return ;
}

总结:

1、这道题目比较麻烦,首先输入的数据是每个考生的全部提交信息,有可能一道题交多次,也可能一次也没交。最终要求统计输出每个考生的信息,按照总分排名顺序。这里有几个注意的地方。1)N个考生,他们的id是从1到N连续的,所以可以用int存储id,并且在输入时将id作为数组的下标,这样便于将同一个人的多次提交全部汇总。 2)未编译通过的题目(为-1)在计算总分时按0分算,在最终输出时也输出0。 3)全部未提交或者全部未编译成功的考生不做输出,但全为0分的考生需要输出。所以需要区分未提交、未编译通过、提交且编译通过但得分为0这三种情况。

2、struct的初始化

  typedef struct infoStruct{
    int id;
    int prob[6];
    int perfect;
    int full;
    int rank;
    int shown;
    infoStruct(){
      perfect = 0;
      shown = 0;
      for(int i = 0; i < 6; i++)
      prob[i] = -2;
    }
  }info;

3、起初写这道题时没有注意到题目里的id是从1到N连续的这一条件,盲目把struct里的id设置成了char数组型,导致每一条输入都需要从头开始找相同的id并作合并,复杂度变成了n^2,最后一个测试点超时。改为用int存储id,并将id映射为数组下标后,测试通过。今后在输入数据量较大的时候一定要先考虑到复杂度。算法超时的代码:

 #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct infoStruct{
char id[];
int prob[];
int perfect;
int full;
int rank;
int shown;
infoStruct(){
perfect = ;
shown = ;
for(int i = ; i < ; i++)
prob[i] = -;
}
}info;
bool cmp(info a, info b){
if(a.full != b.full)
return a.full > b.full;
else if(a.perfect != b.perfect)
return a.perfect > b.perfect;
else return strcmp(a.id, b.id) < ;
}
info user[];
int main(){
int N, K, M, fullSco[];
char tempId[];
int tempPro, tempSco;
scanf("%d%d%d", &N, &K, &M);
for(int i = ; i <= K; i++)
scanf("%d", &fullSco[i]);
for(int i = , j = ; i < M; i++){
scanf("%s %d%d", tempId, &tempPro, &tempSco);
int index = -;
for(int k = ; k < j; k++){
if(strcmp(tempId, user[k].id) == ){
index = k;
break;
}
}
if(index == -){
index = j;
strcpy(user[index].id, tempId);
j++;
}
if(tempSco == fullSco[tempPro] && user[index].prob[tempPro] != fullSco[tempPro])
user[index].perfect++;
if(user[index].prob[tempPro] < tempSco){
user[index].prob[tempPro] = tempSco;
if(tempSco >= )
user[index].shown = ;
}
}
for(int i = ; i < N; i++){
int ans = ;
for(int j = ; j <= K; j++){
if(user[i].prob[j] > )
ans += user[i].prob[j];
}
user[i].full = ans;
}
sort(user, user + N, cmp);
user[].rank = ;
for(int i = ; i < N; i++){
if(user[i].full == user[i - ].full)
user[i].rank = user[i - ].rank;
else user[i].rank = i + ;
}
for(int i = ; i < N; i++){
if(user[i].shown == ){
printf("%d %s %d", user[i].rank, user[i].id, user[i].full);
for(int j = ; j <= K; j++){
if(user[i].prob[j] == -)
printf("");
else if(user[i].prob[j] == -)
printf(" -");
else printf(" %d", user[i].prob[j]);
}
printf("\n");
}
}
cin >> K;
return ;
}

A1075. PAT Judge的更多相关文章

  1. A1075 PAT Judge (25)(25 分)

    A1075 PAT Judge (25)(25 分) The ranklist of PAT is generated from the status list, which shows the sc ...

  2. PAT A1075 PAT Judge (25 分)——结构体初始化,排序

    The ranklist of PAT is generated from the status list, which shows the scores of the submissions. Th ...

  3. A1075 PAT Judge (25 分)

    The ranklist of PAT is generated from the status list, which shows the scores of the submissions. Th ...

  4. PAT甲级——A1075 PAT Judge

    The ranklist of PAT is generated from the status list, which shows the scores of the submissions. Th ...

  5. PAT_A1075#PAT Judge

    Source: PAT A1075 PAT Judge (25 分) Description: The ranklist of PAT is generated from the status lis ...

  6. PAT 1075 PAT Judge[比较]

    1075 PAT Judge (25 分) The ranklist of PAT is generated from the status list, which shows the scores ...

  7. PTA 10-排序5 PAT Judge (25分)

    题目地址 https://pta.patest.cn/pta/test/16/exam/4/question/677 5-15 PAT Judge   (25分) The ranklist of PA ...

  8. PAT 甲级 1075 PAT Judge (25分)(较简单,注意细节)

    1075 PAT Judge (25分)   The ranklist of PAT is generated from the status list, which shows the scores ...

  9. PAT Judge

    原题连接:https://pta.patest.cn/pta/test/16/exam/4/question/677 题目如下: The ranklist of PAT is generated fr ...

随机推荐

  1. RabbitMQ 优先级队列-为队列赋权

    RabbitMQ 消息收发是按顺序收发,一般情况下是先收到的消息先处理,即可以实现先进先出的消息处理.但如果消息者宕机或其他原因,导致消息接收以后,未确认,那么消息会重新Requeue到队列中,就打破 ...

  2. 懒人小工具1:winform自动生成Model,Insert,Select,Delete以及导出Excel的方法

       懒人小工具2:T4自动生成Model,Insert,Select,Delete以及导出Excel的方法    github地址:https://github.com/Jimmey-Jiang/J ...

  3. 终于做完了这个pj

    首先要说这个博客网站实在是功能太弱!不知道为什么还要每次写博客.直接交作业不好吗- -b 1.估计时间: 看见这个任务就觉得很难啊,估计装vs2012就得半天,然后上学期选修的c++基本上都忘光了,本 ...

  4. 如何在java项目中使用lucene

    lucene是一个开源的全文检索引擎工具包,但它不是一个成型的搜索引擎,它的功能就是负责将文本数据按照某种分词算法进行分词,分词后的结果存储在索引库中,然后根据关键字从索引库检检索. 那么应该如何使用 ...

  5. linux内实践核分析模块

  6. jeecg的下拉列表

    jeecg里面下拉列表的使用 ①建立数据字典seo_id <t:dictSelect field="operationPromotionAccount" typeGroupC ...

  7. node基础 npm、module、exports、require

    module 模块.包:可以认为是一个代码包,package,提供特定的功能(暴露给外界接口,让外界调用) exports 输出.导出:导出模块中的各种类型的变量,以及各种方法,导出之后,才可以被外界 ...

  8. JavaScript 编程易错点整理

    Case 1: 通过getElementById("id")获得是一个DOM元素节点对象: 通过getElementsByTagName("tagName")获 ...

  9. Hacked VisualSVN Server by PHP to allow user change password

    index.php <?php$username = $_SERVER["PHP_AUTH_USER"]; //经过 AuthType Basic 认证的用户名$authed ...

  10. Node 表单query

    //#使用nodejs编写动态的web服务器//1:加载需要模块 fs http urlconst fs = require("fs");const http = require( ...