【PAT乙级】1095 解码PAT准考证 (25 分)

题目地址

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map> 
#include<unordered_map> 
using namespace std;
int n,m;
const int N=1e5+10;
struct student
{
	string s;
	int test;
	int day;
	int score;
}a[N];
bool cmp(student a,student b)
{
	if(a.score==b.score)
		return a.s<b.s;
	return a.score>b.score;
}
bool cmp1(student a,student b)
{
    if(a.score==b.score)
		return a.test<b.test;
	return a.score>b.score;
}
int main(void)
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
	{
		cin>>a[i].s;
		scanf("%d",&a[i].score);
		a[i].test=stoi(a[i].s.substr(1,3));
		a[i].day=stoi(a[i].s.substr(4,6));
	}
	sort(a,a+n,cmp);
	for(int i=1;i<=m;i++)
	{
		int op; scanf("%d",&op);
		if(op==1)
		{
			char c; scanf(" %c",&c);
			printf("Case %d: %d %c\n",i,op,c);
			bool flag=true;
			for(int i=0;i<n;i++)
			{
				if(a[i].s[0]==c) 
				{
					printf("%s %d\n",a[i].s.c_str(),a[i].score);
					flag=false;
				}
			}
			if(flag) puts("NA");
		}
		else if(op==2)
		{
			int c; scanf("%d",&c);
			int cnt=0,sum=0;
			printf("Case %d: %d %d\n",i,op,c);
			for(int i=0;i<n;i++)
			{
				if(a[i].test==c) cnt++,sum+=a[i].score;
			}
			if(cnt) printf("%d %d\n",cnt,sum);
			else puts("NA");
		}
		else
		{
			int c; scanf("%d",&c);
			printf("Case %d: %d %06d\n",i,op,c);
			vector<student>ans;
			unordered_map<int,int>s;
			for(int i=0;i<n;i++)
			{
				if(a[i].day==c)
				{
					s[a[i].test]++;
				}
			}
			for(auto t=s.begin();t!=s.end();t++)
			{
				struct student temp;
				temp.test=t->first;
				temp.score=t->second;
				ans.push_back(temp);
			}
			sort(ans.begin(),ans.end(),cmp1);
			if(ans.size())
			{
				for(int i=0;i<ans.size();i++)
				{
					printf("%d %d\n",ans[i].test,ans[i].score);
				}
			}
			else puts("NA");
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
struct node
{
	string id,day;
	int test,score;
}temp;
struct demo
{
	int id,cnt;
};
bool cmp(node a,node b)
{
	if(a.score==b.score) return a.id<b.id;
	return a.score>b.score;
}
bool cmp1(demo a,demo b)
{
	if(a.cnt==b.cnt) return a.id<b.id;
	return a.cnt>b.cnt;
}
vector<node>ve[3]; 
map<int,int>mp,val;
int n,m;
void print(int k)
{
	for(int i=0;i<ve[k].size();i++) 
	printf("%s %d\n",ve[k][i].id.c_str(),ve[k][i].score);
}
int main(void)
{
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		string s; int score;
		cin>>s; scanf("%d",&score);
		temp.id=s;
		temp.day=s.substr(4,6);
		temp.score=score;
		temp.test=stoi(s.substr(1,3));
		if(s[0]=='A') ve[0].push_back(temp);
		if(s[0]=='B') ve[1].push_back(temp);
		if(s[0]=='T') ve[2].push_back(temp);
		mp[temp.test]++;
		val[temp.test]+=score;
	}
	for(int i=0;i<3;i++) sort(ve[i].begin(),ve[i].end(),cmp);
	for(int i=1;i<=m;i++)
	{
		int k; scanf("%d",&k);
		if(k==1)
		{
			char s; scanf(" %c",&s);
			printf("Case %d: %d %c\n",i,k,s);
			int op=0;
			if(s=='A')   op=0;
			else if(s=='B') op=1;
			else  op=2;
			print(op);
			if(ve[op].size()==0) puts("NA");
		}
		else if(k==2)
		{
			int a; scanf("%d",&a);
			printf("Case %d: %d %d\n",i,k,a);
			if(mp[a]) printf("%d %d\n",mp[a],val[a]);
			else puts("NA");
		}
		else 
		{
			string s; cin>>s;
			printf("Case %d: %d %s\n",i,k,s.c_str());
			vector<demo>ans;
			map<int,int>cnt;
			for(int i=0;i<3;i++)
				for(int j=0;j<ve[i].size();j++)
					if(ve[i][j].day==s) cnt[ve[i][j].test]++;
			for(auto i=cnt.begin();i!=cnt.end();i++)
			{
				ans.push_back({i->first,i->second});
			}
			sort(ans.begin(),ans.end(),cmp1);
			if(ans.size())
			for(int i=0;i<ans.size();i++) printf("%d %d\n",ans[i].id,ans[i].cnt);
			else puts("NA");
		}
	}
	return 0;
}