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. HTML-JS 数组 内置对象

    [JS中的数组] 1.数组的基本概念? 数组是在内存空间中连续存储的一组有序数据的集合 元素在数组中的顺序,称为下标.可以使用下标访问数组的每个元素 2.如何声明一个数组 ① 使用字面量声明:var ...

  2. Redis+TwemProxy(nutcracker)集群方案部署记录

    Twemproxy 又称nutcracker ,是一个memcache.Redis协议的轻量级代理,一个用于sharding 的中间件.有了Twemproxy,客户端不直接访问Redis服务器,而是通 ...

  3. <<浪潮之巅>>阅读笔记一

    第一次的阅读就想读这本书的,却因为很多愿意一直拖到现在,因为听说这本书在李开复先生 的微博上有推荐,更是增加了我的阅读兴趣.可能是因为在网上找的电子版的原因,通篇阅读的速度很快,但是没有纸质数那种细嚼 ...

  4. 【软件工程】5.8 黑盒&白盒测试

    代码链接:http://www.cnblogs.com/bobbywei/p/4469145.html#3174062 搭档博客:http://www.cnblogs.com/Roc201306114 ...

  5. 开源通用爬虫框架YayCrawler-页面的抽取规则定义

    本节我将向大家介绍一下YayCrawler的核心-页面的抽取规则定义,这也是YayCrawler能够做到通用的主要原因之一.如果我要爬去不同的网站的数据,尽管他们的网站采用的开发技术不同.页面的结构不 ...

  6. ubuntu编译安装php7遇到的问题及解决方案

    configure: error: Cannot find OpenSSL's <evp.h> 这个可以在configure的时候,指定openssl的路径,查看openssl的安装路径: ...

  7. Use curl with uuid(uuidgen) under shell

    #!set uuidtmp = uuid.tmp #!uuidgen > $uuidtmp #!set uuid=<$uuidtmp #!rm $uuidtmp #!echo $uuid ...

  8. JavaScript模拟表单(带数组的复杂数据结构)提交

    function test(){    var typeArray = new Array();    typeArray.push("mm");    typeArray.pus ...

  9. Web接口测试-HttpClient

    要实现Web接口测试的自动化有许多方式,比如利用Jmeter.Loadrunner等测试工具都能够实现接口的自动化测试,我们也可以利用一些开源的框架来实现接口的自动化测试,比如我们现在要说的这个Htt ...

  10. [转帖]Nginx的超时keeplive_timeout配置详解

    Nginx的超时keeplive_timeout配置详解 https://blog.csdn.net/weixin_42350212/article/details/81123932   Nginx  ...