QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567850 | #9320. Find the Easiest Problem | wirepuller | WA | 9ms | 3640kb | C++20 | 878b | 2024-09-16 14:15:14 | 2024-09-16 14:15:15 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
const int N = 1e5+10;
int a[N], b[N];
void solve()
{
int n, m, k;
cin >> n;
map<string, int> vis;
map<string, int> num;
for (int i = 1; i<=n; i++){
string name, pro, sta;
cin >> name >> pro >> sta;
if (sta == "accepted" && vis[name]==0){
num[pro]++;
vis[name] = 1;
}
}
int ans = 0;
string s;
for (auto [k, v]:num){
if (v > ans){
ans = v;
s = k;
}
}
// cout << ans << endl;
cout << s << endl;
}
signed main()
{
ios::sync_with_stdio(false);
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: 3568kb
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: 9ms
memory: 3640kb
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:
O P P A B I N H V A T I F R E C N F I V A B S B A O A E F O F A Y O H G K Z B F F D R C U T W I A I J A K L I M C C B A V O F A E A H R B G J O F H D B E A B W H M O I B E F W A E P H F N J Y K P V X O B P I K X L Z H Q B D B T F C B U F L A H T I G A C R G V A N O N K I M R H N J K F K A G N F B H ...
result:
wrong answer 1st lines differ - expected: 'Z', found: 'O'