QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #574809 | #9320. Find the Easiest Problem | winterl | RE | 0ms | 3676kb | C++20 | 901b | 2024-09-19 00:48:58 | 2024-09-19 00:48:58 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
map<string,int> m;
auto solve() {
int n;
cin>>n;
vector a(27, 0);
vector vis(n + 1, vector(27, false));
int j = 1;
for (int i = 1; i <= n; i++) {
string s1,s2;
char zm;
cin>>s1;
cin>>zm;
cin>>s2;
if (m.find(s1) == m.end()) {
m[s1] = j++;
}
if(!vis[m[s1]][zm - 'A'+1] and s2 == "accepted") {
a[zm - 'A'+1]++;
vis[m[s1]][zm - 'A'+1] = true;
}
}
int ans = 0,ans_i = 0;
for (int i = 1; i <= 26; i++) {
if(a[i] > ans) {
ans = a[i];
ans_i = i;
}
}
cout<<char(ans_i+64)<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64_t t;
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: 3676kb
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
Runtime Error
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 I B I G H S 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 R