QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #578753 | #9320. Find the Easiest Problem | jk231528 | RE | 0ms | 0kb | C++14 | 611b | 2024-09-20 21:08:40 | 2024-09-20 21:08:45 |
answer
#include<iostream>
#include<set>
#include<cstring>
using namespace std;
const int N=2e5+8;
set<string>tm[30];
int main()
{
cin.tie(0)->sync_with_stdio(false);
int t;cin>>t;
while(t--)
{
int n;cin>>n;
int res,maxx=0;
for(int i=1;i<=30;i++ ) tm[i].clear();
for(int i=1;i<=n;i++ )
{
string s;cin>>s;
char x;cin>>x;
int num=x-'A'+1;
string rt;cin>>rt;
if(rt=="accepted")
{
tm[num].insert(s);
}
}
for(int i=1;i<=30;i++)
{
if(tm[i].size()>maxx)
maxx=tm[i].size(),res=i;
}
res=res+'A'-1;
printf("%c\n",res);
}
return 0;
}
详细
Test #1:
score: 0
Runtime Error
input:
2 5 teamA A accepted teamB B rejected teamC A accepted teamB B accepted teamD C accepted 4 teamA A rejected teamB A accepted teamC B accepted teamC B accepted