QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #589570 | #9320. Find the Easiest Problem | tjrac6022203192 | WA | 0ms | 3808kb | C++14 | 607b | 2024-09-25 18:36:37 | 2024-09-25 18:36:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+10;
const ll mod=998244353;
ll a[N];
ll f[N];
void solve()
{
ll n;
cin>>n;
map<string,set<string>>mp;
for(int i=1;i<=n;i++)
{
string a,b,c;
if(c[0]=='a')
{
mp[b].insert(a);
}
}
int maxx=0;
string ans;
for(auto it:mp)
{
if(it.second.size()>maxx)
{
maxx=it.second.size();
ans=it.first;
}
}
cout<<ans<<"\n";
}
int main()
{
int t=1;
// cin>>t;
while(t--) solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3808kb
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
output:
result:
wrong answer 1st lines differ - expected: 'A', found: ''