题目链接
题目描述
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 andB
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 correspondingTerm
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 correspondingTerm
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 correspondingTerm
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
whereNt
is the total number of testees andNs
is their total score; - for a type 3 query, output in the format
Site Nt
whereSite
is the site number andNt
is the total number of testees atSite
. The output must be in non-increasing order ofNt
's, or in increasing order of site numbers if there is a tie ofNt
.
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
结尾无空行
题目大意
输入学生的准考证号和成绩,按照规定的方式选择数据并输出
解题思路
一开始想的各种map,给自己都套蒙了,看了看柳婼发现只用存一个总的,然后每次在里面筛选就不会超时,emm话说这种模拟题都不知道什么时候会超时什么时候不会超时,以后可以先写一个思路简单但是可能会超时的情况,万一就不超时了呢
还有就是switch里面不允许定义变量?只能在switch里面定义?
将string转化为char类型字符串通过%s输出,string.c_str()
题解
#include<bits/stdc++.h>
using namespace std;
struct Node{
string id;
int grade;
};
vector<Node> v;
bool cmp(Node a,Node b){
return a.grade==b.grade?a.id<b.id:a.grade>b.grade;
}
int main(){
int n,m;
scanf("%d %d",&n,&m);
v.resize(n);
for(int i=0;i<n;i++){
cin>>v[i].id>>v[i].grade;
}
for(int k=1;k<=m;k++){
int flag;
string t;
scanf("%d",&flag);
cin>>t;
printf("Case %d: %d %s\n",k,flag,t.c_str());
vector<Node> temp;
int sum,num;
map<string,int> ma;
switch(flag){
case 1:
for(int i=0;i<n;i++){
if(t==v[i].id.substr(0,1)){
temp.push_back(v[i]);
}
}
sort(temp.begin(),temp.end(),cmp);
if(temp.size()==0) printf("NA\n");
else{
for(int i=0;i<temp.size();i++){
printf("%s %d\n",temp[i].id.c_str(),temp[i].grade);
}
}
break;
case 2:
sum=0;
num=0;
for(int i=0;i<n;i++){
if(t==v[i].id.substr(1,3)){
sum+=v[i].grade;
num++;
}
}
if(num==0) printf("NA\n");
else printf("%d %d\n",num,sum);
break;
case 3:
for(int i=0;i<n;i++){
if(t==v[i].id.substr(4,6)){
ma[v[i].id.substr(1,3)]++;
}
}
for(auto it=ma.begin();it!=ma.end();it++){
temp.push_back(Node{it->first,it->second});
}
sort(temp.begin(),temp.end(),cmp);
if(temp.size()==0) printf("NA\n");
else{
for(int i=0;i<temp.size();i++){
printf("%s %d\n",temp[i].id.c_str(),temp[i].grade);
}
}
break;
}
}
}