文章目录
Author: 陈越
Organization: 浙江大学
Time Limit: 200 ms
Memory Limit: 64 MB
Code Size Limit: 16 KB
A1153 Decode Registration Card of PAT (25 point(s))
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^4) 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
Code
方法一
#include <bits/stdc++.h>
using namespace std;
struct INFO{
string info;
int score;
};
bool cmp(INFO a,INFO b){
if(a.score==b.score) return a.info<b.info;
else return a.score>b.score;
}
int main(){
int n,m,type;
string s;
cin >>n>>m;
vector<INFO> stu(n);
for(int i=0;i<n;i++){
cin >> stu[i].info >> stu[i].score;
}
sort(stu.begin(),stu.end(),cmp); // 输入数据后就对所有数据进行排序
for(int i=1;i<=m;i++){
int sum=0,cnt=0;
vector<INFO> t;
int flag=0;
cin >>type>>s;
cout << "Case "<< i << ": " << type << " " <<s << "\n";
if(type==1){
for(int j=0;j<stu.size();j++){
if(stu[j].info.substr(0,1)==s){
cout << stu[j].info << " " << stu[j].score<< "\n";
flag=1;
}
}
if(flag==0) cout << "NA\n";
}
else if(type==2){
for(int j=0;j<stu.size();j++){
if(stu[j].info.substr(1,3)==s){
sum+=stu[j].score;
cnt++;
}
}
if(cnt!=0) cout << cnt << " " << sum << "\n";
else cout << "NA\n";
}
else if(type==3){
unordered_map<string,int> cnts;
for(int j=0;j<stu.size();j++){
if(stu[j].info.substr(4,6)==s){
cnts[stu[j].info.substr(1,3) ]++;
}
}
for(unordered_map<string,int>::iterator it=cnts.begin();it!=cnts.end();it++){
if(it->second!=0){
t.push_back({it->first,it->second});
}
}
sort(t.begin(),t.end(),cmp);
for(int j=0;j<t.size();j++){
cout << t[j].info << " " << t[j].score<< "\n";
}
if(t.size()==0) cout << "NA\n";
}
}
return 0;
}
方法二
/--------------------------------上方代码同方法一--------------------------------------/
int main(){
int n,m,type;
string s;
cin >>n>>m;
vector<INFO> stu(n);
for(int i=0;i<n;i++){
cin >> stu[i].info >> stu[i].score;
}
for(int i=1;i<=m;i++){
int sum=0,cnt=0;
vector<INFO> t;
cin >>type>>s;
cout << "Case "<< i << ": " << type << " " <<s << "\n";
if(type==1){
for(int j=0;j<stu.size();j++){
if(stu[j].info.substr(0,1)==s){
t.push_back(stu[j]);
}
}
sort(t.begin(),t.end(),cmp); // 当type==1时对符合条件的数据排序
for(int j=0;j<t.size();j++){
cout << t[j].info << " " << t[j].score<< "\n";
}
if(t.size()==0) cout << "NA\n";
}
/--------------------------------下方代码同方法一--------------------------------------/
Analysis
-已知PAT的ID和对应分数。
-给出M个查询。查询有三种类型,分别为等级、座位号和日期。对于不同的查询类型,按照要求输出结果。
-可以一开始就把所有的数据进行排序,结果为:
-也可以按照放在type1的情况中,即上述写法,结果为:
-此时我们可以发现,测试点四中type==1的情况比较多。