QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#576688 | #9320. Find the Easiest Problem | kramQAQ | WA | 5ms | 3808kb | C++14 | 665b | 2024-09-19 21:35:16 | 2024-09-19 21:35:16 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
void solve()
{
int n;
cin >> n;
int ans = 0;
string s1,s2;
char x;
set<char> st[27];
while(n--){
cin >> s1;
cin >> x;
cin >> s2;
if (s2 == "accepted") st[x-'A'].insert(s1[5]);
}
for (int i = 0; i <= 'Z'-'A'; ++i){
if (st[i].size() > st[ans].size()) ans = i;
}
cout << char('A'+ans) << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
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:
A A
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 5ms
memory: 3612kb
input:
1000 44 WaiooyIXa O accepted WaiooyIXa P accepted ZYYsNWag P accepted DPIawQg D rejected IzPdjnM Z rejected Ra D rejected kwQyGxLo I rejected DPIawQg L accepted kwQyGxLo I accepted mmWxDuADCB D rejected PXwVAOgwiz P rejected ZYYsNWag U accepted IzPdjnM Z accepted TgBNO P rejected kwQyGxLo J accepted...
output:
Z E Z O B I G H T K J I H R Z C K O I P A B I A A N A B A O F O R T H G K E S D F D O C U V W P A O J E A B U M C T B Y V A O N E O H F B G J I E M A A E A K W J P E W Z K F I S P M H G G H W I P T D O A F N C L Y Z S G J F Q F O C B B U C I A E I P K C R X N D N L Q L I X I H U J Z D K G F T F B H ...
result:
wrong answer 4th lines differ - expected: 'I', found: 'O'