QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #578760 | #9320. Find the Easiest Problem | jk231528 | RE | 0ms | 0kb | C++14 | 542b | 2024-09-20 21:10:58 | 2024-09-20 21:10:59 |
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=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;
string rt;cin>>rt;
if(rt=="accepted") tm[x-'A'].insert(s);
}
for(int i=1;i<=30;i++)
{
if(tm[i].size()>tm[res].size())res=i;
}
printf("%c\n",res+'A');
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
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