PAT甲级 1153 Decode Registration Card of PAT (25 分)

A registration card number of PAT consists of 4 parts:

• the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;
• the 2nd - 4th digits are the test site number, ranged from 101 to 999;
• the 5th - 10th digits give the test date, in the form of yymmdd;
• finally the 11th - 13th digits are the testee’s number, ranged from 000 to 999.

Now given a set of registration card numbers and the scores of the card owners, you are supposed to output the various statistics according to the given queries.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (≤10⁴) and M (≤100), the numbers of cards and the queries, respectively.

Then N lines follow, each gives a card number and the owner’s score (integer in [0,100]), separated by a space.

After the info of testees, there are M lines, each gives a query in the format Type Term, where

• Type being 1 means to output all the testees on a given level, in non-increasing order of their scores. The corresponding Term will be the letter which specifies the level;
• Type being 2 means to output the total number of testees together with their total scores in a given site. The corresponding Term will then be the site number;
• Type being 3 means to output the total number of testees of every site for a given test date. The corresponding Term will then be the date, given in the same format as in the registration card.

Output Specification:

For each query, first print in a line Case #: input, where # is the index of the query case, starting from 1; and input is a copy of the corresponding input query. Then output as requested:

• for a type 1 query, the output format is the same as in input, that is, CardNumber Score. If there is a tie of the scores, output in increasing alphabetical order of their card numbers (uniqueness of the card numbers is guaranteed);
• for a type 2 query, output in the format Nt Ns where Nt is the total number of testees and Ns is their total score;
• for a type 3 query, output in the format Site Nt where Site is the site number and Nt is the total number of testees at Site. The output must be in non-increasing order of Nt's, or in increasing order of site numbers if there is a tie of Nt.

If the result of a query is empty, simply print NA.

Sample Input:

8 4
B123180908127 99
B102180908003 86
A112180318002 98
T107150310127 62
A107180908108 100
T123180908010 78
B112160918035 88
A107180908021 98
1 A
2 107
3 180908
2 999

Sample Output:

Case 1: 1 A
A107180908108 100
A107180908021 98
A112180318002 98
Case 2: 2 107
3 260
Case 3: 3 180908
107 2
123 2
102 1
Case 4: 2 999
NA

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;
struct peoInfo {
    string id;
    string type;
    int grade;
    string site;
    string date;
} peo[10005];
struct querryTwo {
    int value;
    string site;
} querry[1001];

bool cmp1(peoInfo p1, peoInfo p2) {
    if (p1.grade == p2.grade)
        return p1.id < p2.id;
    else
        return p1.grade > p2.grade;
}


bool cmp2(querryTwo q1, querryTwo q2) {
    if (q1.value == q2.value)
        return q1.site < q2.site;
    else
        return q1.value > q2.value;
}

int main() {
    int n, m;
    cin >> n >> m;
    string id;
    int grade;
    for (int i = 0; i < n; ++i) {
        cin >> id >> grade;
        peo[i].id = id;
        peo[i].grade = grade;
        peo[i].site = id.substr(1, 3);
        peo[i].date = id.substr(4, 6);
        peo[i].type = id[0];
    }
    int query_id;
    string query_string;
    for (int i = 1; i <= m; ++i) {
        cin >> query_id >> query_string;
        cout << "Case " << i << ": " << query_id << " " << query_string << endl;
        vector<peoInfo> v;
        if (query_id == 1) {
            for (int j = 0; j < n; ++j) {
                if (peo[j].type == query_string)
                    v.push_back(peo[j]);
            }
            if (v.empty())
                cout << "NA" << endl;
            else
                sort(v.begin(), v.end(), cmp1);
            for (auto &s:v)
                printf("%s %d\n", s.id.c_str(), s.grade);
        } else if (query_id == 2) {
            int sum = 0;
            int num = 0;
            for (int j = 0; j < n; ++j) {
                if (peo[j].site == query_string) {
                    sum += peo[j].grade;
                    num++;
                }
            }
            if (num)
                cout << num << " " << sum << endl;
            else
                cout << "NA" << endl;
        } else if (query_id == 3) {
            unordered_map<string, int> map;
            for (int j = 0; j < n; ++j) {
                if (peo[j].date == query_string)
                    map[peo[j].site]++;
            }
            int k = 0;
            for (auto &it:map) {
                querry[k].site = it.first;
                querry[k++].value = it.second;
            }
            if (!map.empty()) {
                sort(querry, querry + k, cmp2);
                for (int j = 0; j < k; ++j)
                    printf("%s %d\n", querry[j].site.c_str(), querry[j].value);
            } else
                cout << "NA" << endl;
        }
    }
    return 0;
}