題目

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

解析

這道題目輸入多個(gè)考場(chǎng)的學(xué)生學(xué)號(hào)，分?jǐn)?shù)，然后融合之后排序輸出學(xué)號(hào)、總的排名、考場(chǎng)編號(hào)、考場(chǎng)內(nèi)排名

需要注意幾個(gè)細(xì)節(jié)：

• 學(xué)號(hào)可以用string存儲(chǔ)，也可以用long long,但是不能用int，會(huì)超出存儲(chǔ)范圍。同時(shí)如果用long long，需要考慮到學(xué)號(hào)起始可能為0，直接存儲(chǔ)時(shí)會(huì)導(dǎo)致前置0的丟失。所以在輸出時(shí)需要補(bǔ)齊為13位
• 考場(chǎng)編號(hào)是從1開始的
• 分?jǐn)?shù)相同的排名相同，如果有排名相同，后面排名就要后移，如1、1、3、4、4、6

代碼

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

bool cmp(vector<long long> &v1,vector<long long> &v2){
    if(v1[1]!=v2[1]) return v1[1]>v2[1];
    else return v1[0]<v2[0];
}

void update(vector<vector<long long>> &v,int nloc){
    if(v.empty()) return;
    vector<int> rank(nloc,0);
    vector<int> lastIndex(nloc,0);
    int r=1,s=v[0][1];
    v[0][2]=1;
    v[0][4]=1;
    lastIndex[v[0][3]-1]=0;
    rank[v[0][3]-1]=2;
    for(int i=1;i<v.size();i++){
        r++;
        if(s==v[i][1]) v[i][2]=v[i-1][2];
        else{
            s=v[i][1];
            v[i][2]=r;
        }
        int index=v[i][3]-1;
        if(rank[index]==0){
            v[i][4]=1;
            rank[index]=2;
            lastIndex[index]=i;
        }
        else{
            int score=v[lastIndex[index]][1];
            if(v[i][1]==score)
                v[i][4]=v[lastIndex[index]][4];
            else{
                v[i][4]=rank[index];
            }
            lastIndex[index]=i;
            rank[index]+=1;
        }
    }
}


int main()
{
    vector<vector<long long>> stu;
    int n;
    int sum=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int m;
        scanf("%d",&m);
        for(int j=0;j<m;j++){
            sum+=1;
            long long id,score;
            cin>>id>>score;
            vector<long long> tmp={id,score,0,i+1,0};
            stu.push_back(tmp);
        }
    }
    sort(stu.begin(),stu.end(),cmp);
    update(stu,n);
    cout<<sum<<endl;
    for(auto &v:stu){
        printf("%013lld %lld %lld %lld\n",v[0],v[2],v[3],v[4]);
    }
    return 0;
}