PAT甲级刷题记录——1025 PAT Ranking (25分)

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

思路

这题还是比较简单的哈，给我个人的感觉这题和【1012 The Best Rank (25分)】很像，都需要处理成绩相同时，排名也是相同的情况。因此，为了防止出现各种小坑，建议写构造函数初始化。

这题和BestRank唯一不同的地方在于，需要处理考场的排名，因此，我们需要用一个List来存放所有人，再用一个temp来存放当前考场的人，当对当前考场的数据读完之后，立刻对temp进行排序，并处理local_rank，处理好了之后再把temp中的所有学生放入List里（此时所有学生的local_rank应该已经是处理好了的，只有final_rank是待处理状态），然后把temp清空，用来准备存放下一个考场的人。

最后需要注意的是，成绩（第一标尺）相同的话，ID要按升序排列（第二标尺），其他就没什么啦，还是很简单的一道排序题~

代码

#include<cstdio>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string>
#include<string.h>
#include<iostream>
using namespace std;
struct student{
    string ID;
    int location_number;
    int final_rank, local_rank;
    int score;
    student(){
        ID.clear();
        location_number = final_rank = local_rank = score = 0;
    }
};
vector<student> List, temp;
bool cmp(student a, student b){
    if(a.score!=b.score) return a.score>b.score;
    else return a.ID<b.ID;
}
int main()
{
    int N;
    cin>>N;
    for(int i=1;i<=N;i++){
        int K;
        cin>>K;
        for(int j=0;j<K;j++){
            string tmpID;
            int tmpScore;
            cin>>tmpID>>tmpScore;
            student tmp;
            tmp.ID = tmpID;
            tmp.score = tmpScore;
            tmp.location_number = i;
            temp.push_back(tmp);
        }
        sort(temp.begin(), temp.end(), cmp);
        int LastScore = 0, LastRank = 0;
        for(int i=0;i<temp.size();i++){
            if(i==0){
                temp[i].local_rank = i+1;
                LastScore = temp[i].score;
                LastRank = temp[i].local_rank;
            }
            else{
                if(temp[i].score==temp[i-1].score){
                    temp[i].local_rank = temp[i-1].local_rank;
                }
                else{
                    temp[i].local_rank = i+1;
                    LastScore = temp[i].score;
                    LastRank = temp[i].local_rank;
                }
            }
        }
        for(int i=0;i<temp.size();i++){
            List.push_back(temp[i]);
        }
        temp.clear();
    }
    sort(List.begin(), List.end(), cmp);
    int LastScore = 0, LastRank = 0;
    for(int i=0;i<List.size();i++){
        if(i==0){
            List[i].final_rank = i+1;
            LastScore = List[i].score;
            LastRank = List[i].final_rank;
        }
        else{
            if(List[i].score==List[i-1].score){
                List[i].final_rank = List[i-1].final_rank;
            }
            else{
                List[i].final_rank = i+1;
                LastScore = List[i].score;
                LastRank = List[i].final_rank;
            }
        }
    }
    cout<<List.size()<<'\n';
    for(int i=0;i<List.size();i++){
        cout<<List[i].ID<<" "<<List[i].final_rank<<" "<<List[i].location_number<<" "<<List[i].local_rank<<'\n';
    }
    return 0;
}