1153. Decode Registration Card of PAT (25)-PAT甲级真题 (哈希表)

题意

给出人员数量n和询问次数m，依次输入n个人员的id与分数score。然后以【种类typ+关键字tar】形式输入m次询问。

• 种类1是输出目标等级的考生id与分数。以先分数score降序，后id升序的形式排列。
• 种类2是输出目标教室的考生数量和分数总和。
• 种类3是输出目标日期的不同教室对应的考生人数，以先人数cnt降序，后教室id升序的形式排列。

思路

• 没特别的，无脑哈希。同时避免标准io，直接把日期、教室id全看成string。
• 偷了懒，把两个node合在一起写了，第二个的node的cnt字段用第一个node的score字段代替。
• 种类3的想法是用字符串图unordered_map<string, unordered_map<string, int>> 的形式先记录数量，后续询问时再遍历排列输出。

题解

#include<bits/stdc++.h>
using namespace std;
int n, m, score, typ;
string id, tar;
struct node{
	string id;
	int score;
	node(string a, int b): id(a), score(b){};
	bool operator < (const node A) const{
		return score != A.score ? score > A.score : id < A.id; 
	}
};
unordered_map<char, set<node>> type1;
unordered_map<int, int> type21, type22;
unordered_map<string, unordered_map<string, int>> type3;
int main(){
	cin>>n>>m;
	for(int i = 0; i < n; i ++){
		cin>>id>>score;
		type1[id[0]].insert(node(id, score));
		type21[stoi(id.substr(1, 3))] += score;
		type22[stoi(id.substr(1, 3))] ++;
		type3[id.substr(4, 6)][id.substr(1, 3)] ++;
	}
	for(int i = 1; i <= m; i ++){
		cin>>typ>>tar;
		printf("Case %d: %d %s\n", i, typ, tar.c_str());
		if(typ == 1){
			for(auto it : type1[tar[0]])
				printf("%s %d\n", it.id.c_str(), it.score);
			if(!type1[tar[0]].size()) puts("NA");		
		}else if(typ == 2){
			if(type22[stoi(tar)])printf("%d %d\n", type22[stoi(tar)], type21[stoi(tar)]);
			else puts("NA");
		}else{
			set<node> tmp;
			for(auto it : type3[tar])
				tmp.insert({it.first, it.second});
			for(auto it : tmp)
				printf("%s %d\n", it.id.c_str(), it.score);
			if(!tmp.size()) puts("NA");
		}
	}
	return 0;
}

题目

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 (≤104) 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