1153 Decode Registration Card of PAT (25 分)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e4+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,x;
string s;
int cnt[maxn][2];
unordered_map<int,int> mp3;
vector<pair<int,string>> v[3];
vector<int> vv[maxn*100];///
int gao(char c1,char c2,char c3){
    return (c1-'0')*100+(c2-'0')*10+(c3-'0');
}
int judge(char c){
    if(c=='T') return 0;
    else if(c=='A') return 1;
    else return 2;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    rep(i,0,n){
        cin>>s>>x;
        int hd=judge(s[0]);
        int test=gao(s[10],s[11],s[12]);
        int site=gao(s[1],s[2],s[3]);
        int date=gao(s[4],s[5],s[6])*1000+gao(s[7],s[8],s[9]);
        cnt[site][0]++,cnt[site][1]+=x;///2
        v[hd].push_back(mk(-x,s));///1
        vv[date].push_back(site);///3
    }
    rep(i,0,3) sort(v[i].begin(),v[i].end());
    rep(i,0,m){
        cout<<"Case "<<i+1<<": ";
        int x;cin>>x;
        if(x==1){
            cin>>s;
            int xx=judge(s[0]);
            cout<<x<<" "<<s<<"\n";
            if(v[xx].size()==0) {cout<<"NA\n";continue;}
            rep(j,0,v[xx].size()){
                cout<<v[xx][j].se<<" "<<-v[xx][j].fi<<"\n";
            }
        }else if(x==2){
            int xx;cin>>xx;
            cout<<x<<" "<<xx<<"\n";
            if(cnt[xx][0]==0) {cout<<"NA\n";continue;}///
            cout<<cnt[xx][0]<<" "<<cnt[xx][1]<<"\n";
        }else if(x==3){
            cin>>s;
            cout<<x<<" "<<s<<"\n";
            int xx=gao(s[0],s[1],s[2])*1000+gao(s[3],s[4],s[5]);
            if(vv[xx].size()==0) {cout<<"NA\n";continue;}///
            mp3.clear();
            rep(j,0,vv[xx].size()){
                mp3[vv[xx][j]]++;
            }
            vector<pair<int,int>> tmpv;tmpv.clear();
            rep(j,0,1005) if(mp3[j]){
                tmpv.push_back(mk(-mp3[j],j));
            }
            sort(tmpv.begin(),tmpv.end());
            rep(j,0,tmpv.size()){
                cout<<tmpv[j].se<<" "<<-tmpv[j].fi<<"\n";
            }
        }
    }
    return 0;
}