QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#566856 | #9320. Find the Easiest Problem | rlaaa | TL | 0ms | 0kb | C++23 | 834b | 2024-09-16 02:29:44 | 2024-09-16 02:29:46 |
answer
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
unordered_map <string, int> mp;//队名
int k,co[26]={0};
cin >> k;
int maxx = -1;char maxname;
for (int i = 0; i < k; k++) {
string team, answer;
char qus;
cin >> team >> qus >> answer;
if (answer == "accepted") {
if (mp[team] >>(qus-'A') &1) continue;
mp[team]|=1<<(qus-'A');
co[qus-'A']++;
if(maxx<co[qus-'A']){
maxx=co[qus-'A'];
maxname=qus;
}
}
}
cout<<maxname<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
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