QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#594085 | #9320. Find the Easiest Problem | Hansen | WA | 0ms | 3508kb | C++14 | 1.1kb | 2024-09-27 19:00:36 | 2024-09-27 19:00:36 |
Judging History
answer
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<math.h>
#include<string>
#include<iostream>
#include<stdlib.h>
#include<cstring>
#include<string.h>
#include<time.h>
#include<ctype.h>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<numeric>
#include<assert.h>
#include<stack>
#include<queue>
#include<deque>
#include<unordered_map>
#include<vector>
#include<map>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
int main() {
int t;
cin >> t;
while (t--)
{
unordered_map<string,int> hash1;
int flag[100005][100] = { 0 }, cnt = 0, shu[200] = { 0 },imax=0;
char ans='A';
int n;
cin >> n;
string team, s;
char q;
for (int i = 1; i <= n; i++)
{
cin >> team >> q >> s;
if (hash1[team] == 0)
hash1[team] = ++cnt;
if (flag[hash1[team]][q] == 0 && s == "accepted")
shu[q]++;
}
for (int i = 65; i <= 65 + 25; i++)
{
if (shu[i] > imax)
{
imax = shu[i];
ans = i;
}
}
cout << ans << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3508kb
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 B
result:
wrong answer 2nd lines differ - expected: 'A', found: 'B'