QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#574686 | #9320. Find the Easiest Problem | winterl | WA | 105ms | 6268kb | C++20 | 817b | 2024-09-18 23:48:15 | 2024-09-18 23:48:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
map<string,int> m;
int a[27];
bool vis[100000][27];
auto solve() {
fill(a,a+27,0);
fill(vis[0],vis[0]+27*100000,0);
int n;
cin>>n;
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]++;
}
}
int ans = 0;
for (int i = 1; i <= 26; i++) {
ans = max(a[i],ans);
}
cout<<char(ans+65)<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64_t t;
cin >> t;
while(t--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 6268kb
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: 105ms
memory: 6244kb
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:
A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A ...
result:
wrong answer 1st lines differ - expected: 'Z', found: 'A'