zoukankan      html  css  js  c++  java
  • pat1025. PAT Ranking (25)

    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
    

    提交代码

    string的相互比较:

     1 #include<string>
     2 #include<iostream>
     3 using namespace std;
     4 int main(){
     5     //freopen("D:\input.txt","r",stdin);
     6     //a.compare(b)
     7     //a>b  1
     8     //a==b 0
     9     //a<b  -1
    10     string a="1234",b="2234";
    11     cout<<a.compare(b)<<endl;
    12     a="1234";
    13     b="1234";
    14     cout<<a.compare(b)<<endl;
    15     a="3234";
    16     b="2234";
    17     cout<<a.compare(b)<<endl;
    18     a="1234";
    19     b="123";
    20     cout<<a.compare(b)<<endl;
    21     a="123";
    22     b="1234";
    23     cout<<a.compare(b)<<endl;
    24     return 0;
    25 }

    比较的思想:
    1.整体排序,注意成绩非升序(成绩相同时,编号升序)。

    2.

    localrank[i]:第i个区域当前的排名,允许成绩相同排名相同。

    lastgrade[i]:第i个区域前一个排名的成绩。

    localnum[i]:第i个区域已经排名的人数。

     1 #include<set>
     2 #include<map>
     3 #include<cstdio>
     4 #include<algorithm>
     5 #include<iostream>
     6 #include<cstring>
     7 #include<queue>
     8 #include<vector>
     9 #include<cmath>
    10 using namespace std;
    11 int localrank[105],lastgrade[105],localnum[105];
    12 //registration_number final_rank location_number local_rank
    13 struct person{
    14     string s;
    15     int grade,localnum;
    16 };
    17 person per[300005];
    18 bool cmp(person a,person b){
    19     if(a.grade==b.grade){
    20         return a.s.compare(b.s)<0;
    21     }
    22     return a.grade>b.grade;
    23 }
    24 int main(){
    25     //freopen("D:\input.txt","r",stdin);
    26     int n;
    27     scanf("%d",&n);
    28     int i,j,k,l;
    29     per[0].grade=101;//哨兵 
    30     l=1;
    31     for(i=1;i<=n;i++){
    32         scanf("%d",&k);
    33         for(j=1;j<=k;j++){
    34             cin>>per[l].s;
    35             scanf("%d",&per[l].grade);
    36             per[l++].localnum=i;
    37         }
    38         lastgrade[i]=101;
    39     }
    40     l--;
    41     sort(per,per+l+1,cmp);
    42     memset(localrank,0,sizeof(localrank));
    43     memset(localnum,0,sizeof(localnum));
    44     int rank;
    45     cout<<l<<endl;
    46     for(i=1;i<=l;i++){
    47         cout<<per[i].s<<" ";
    48         if(per[i].grade<per[i-1].grade){
    49             rank=i;
    50         }
    51         cout<<rank<<" "<<per[i].localnum<<" ";
    52         localnum[per[i].localnum]++;
    53         if(per[i].grade<lastgrade[per[i].localnum]){
    54             lastgrade[per[i].localnum]=per[i].grade;
    55             localrank[per[i].localnum]=localnum[per[i].localnum];
    56         }
    57         cout<<localrank[per[i].localnum]<<endl;
    58     }
    59     return 0;
    60 }
  • 相关阅读:
    计算机视觉的常用测试数据集和源码
    Demo:基于 Flink SQL 构建流式应用
    102万行代码,1270 个问题,Flink 新版发布了什么?
    bilibili 实时平台的架构与实践
    阿里云2020上云采购季来啦!降本增效1亿补贴!
    阿里云助力宁波市教育局“甬上云校”停课不停学
    Quick BI新版本功能解读系列之-V3.5
    百万TPS高吞吐、秒级低延迟,阿里​搜索离线平台如何实现?
    五分钟学会使用 go modules(含在家办公使用技巧)
    OAM 深入解读:OAM 为云原生应用带来哪些价值?
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4766175.html
Copyright © 2011-2022 走看看