关闭

PAT 甲级 1025 PAT Ranking

标签: PAT 1025PAT Ranking
334人阅读 评论(0) 收藏 举报
分类:

1025. PAT Ranking (25)

时间限制
200 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank

The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

Sample Input:
2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85
Sample Output:
9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4
不知道为什么用longlong 表示registration 最后一组过不了,用string就可以了
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <map>
#include <string>

using namespace std;
typedef long long int LL;
int n,k;
struct Node
{
    string num;
    int r1;
    int tag;
    int score;
}a[100005];
int cmp(Node a,Node b)
{
    if(a.score==b.score)
        return a.num<b.num;
    return a.score>b.score;
}
map<string,int> m;
int main()
{
    scanf("%d",&n);
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&k);
        int l=cnt;
        //m.clear();
        for(int j=1;j<=k;j++)
        {
            cin>>a[cnt].num;
            scanf("%d",&a[cnt].score);
            a[cnt++].tag=i;
        }
        sort(a+l,a+l+k,cmp);
        int r=0;
        for(int j=l;j<cnt;j++)
        {
            r++;
            if(j!=l&&a[j].score==a[j-1].score)
                m[a[j].num]=m[a[j-1].num];
            else if(j==l||a[j].score!=a[j-1].score)
                m[a[j].num]=r;
        }
    }
    sort(a,a+cnt,cmp);
    int r=0;
    printf("%d\n",cnt);
    for(int i=0;i<cnt;i++)
    {
        cout<<a[i].num<<" ";
        r++;
        if(i!=0&&a[i].score==a[i-1].score) a[i].r1=a[i-1].r1;
        else if(i==0||a[i].score!=a[i-1].score)
            a[i].r1=r;

        printf("%d %d %d\n",a[i].r1,a[i].tag,m[a[i].num]);
    }
    return 0;
}


0
0
查看评论

【PAT1025】PAT Ranking

1025. PAT Ranking (25) 时间限制 200 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Programming Ability Test (PAT) is...
  • tiantangrenjian
  • tiantangrenjian
  • 2013-11-28 22:00
  • 1938

1025. PAT Ranking (25) PAT 甲级

Problem Description Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test ...
  • SY_Yu
  • SY_Yu
  • 2016-07-19 00:16
  • 324

PAT 1025 PAT Ranking(双重排序)

题目https://www.patest.cn/contests/pat-a-practise/1025 题意:给出每个考场中每个学生的成绩,求所有学生的总排名以及所在考场内的分排名。注意,同分的学生排名相同,其后的学生排名后推。 解题思路简单的排序题,用结构体保存每个学生的所有信息。先对分数局...
  • lecholin
  • lecholin
  • 2017-06-16 19:48
  • 228

PAT甲级1025

1025. PAT Ranking (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue ...
  • qq_22194315
  • qq_22194315
  • 2017-01-17 15:36
  • 231

PAT_乙级 1025 反转链表

1.题目描述: 给定一个常数K以及一个单链表L,请编写程序将L中每K个结点反转。例如:给定L为1→2→3→4→5→6,K为3,则输出应该为3→2→1→6→5→4;如果K为4,则输出应该为4→3→2→1→5→6,即最后不到K个元素不反转。 输入格式: 每个输入包含1个测试用例。每个测试用例第1行...
  • prim_learn
  • prim_learn
  • 2016-12-05 19:32
  • 740

PAT乙级—1025. 反转链表 (25)-native

给定一个常数K以及一个单链表L,请编写程序将L中每K个结点反转。例如:给定L为1→2→3→4→5→6,K为3,则输出应该为3→2→1→6→5→4;如果K为4,则输出应该为4→3→2→1→5→6,即最后不到K个元素不反转。输入格式:每个输入包含1个测试用例。每个测试用例第1行给出第1个结点的地址、结点...
  • wanmeiwushang
  • wanmeiwushang
  • 2016-06-10 22:18
  • 1302

PAT甲级1010

1010. Radix (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Gi...
  • qq_22194315
  • qq_22194315
  • 2017-01-20 17:44
  • 477

PAT甲级题解目录

github源码地址:https://www.github.com/liuchuo/PAT ID Title C/C++(附分析) 备注 1001 A+B Format (20) 查看题解 字符串处理 1002 A+B for Po...
  • liuchuo
  • liuchuo
  • 2016-09-10 22:19
  • 6664

如何刷pat(想要在pat甲级拿80到90分)

遇到不会的题或者交N次都过不了某个测试点,先自己尝试着解决,很长时间没有想法(比如一个小时)后,再去网上搜题解。并且不要直接看代码,看下人家的思路。自己再来做,再做不来就去看代码,也不要直接把代码copy下来改了就交,最好看懂代码自己写。我个人觉得这样才能把别人的东西变成自己的。(MOOC数据结构的...
  • wuhuagu_wuhuaguo
  • wuhuagu_wuhuaguo
  • 2017-05-16 15:23
  • 1923

【note】PAT甲级题目中的单词整理

randomize 使…随机化collaborate 合作gamblers 赌徒inadequate 不充分的shuffles 洗牌casino 赌场simulate 假装,模拟,模仿a deck of playing cards 一副牌Joker 鬼牌红桃(H...
  • liuchuo
  • liuchuo
  • 2016-09-11 22:10
  • 476
    个人资料
    • 访问:132930次
    • 积分:4681
    • 等级:
    • 排名:第7434名
    • 原创:349篇
    • 转载:0篇
    • 译文:0篇
    • 评论:7条
    最新评论