QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#391290 | #8549. The Game | ucup-team1251 | WA | 5ms | 3600kb | C++20 | 811b | 2024-04-16 15:23:49 | 2024-04-16 15:23:49 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int mod = 1e9 + 7;
const int N = 1e6 + 5;
unordered_map<int, int> a, b;
void niko()
{
int n;
long long ans1 = 0, ans2 = 0;
cin >> n;
for (int i = 1; i <= n * 2; i++)
{
cin >> a[i];
b[a[i]]++;
}
for (int i = 1; i <= 2 * n; i++)
{
if (b[a[i]] > 1)
{
ans1 += (b[a[i]] - 1);
}
else if (b[a[i]] == 1)
{
ans2++;
}
b[a[i]] = 0;
}
if (ans1 - 2 >= ans2)
{
cout << "Qingyu" << '\n';
}
else
{
cout << "Kevin" << '\n';
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--)
{
niko();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
3 3 1 1 4 5 1 4 2 1 2 3 4 4 1 2 2 3 2 1 1 4
output:
Qingyu Kevin Qingyu
result:
ok 3 tokens
Test #2:
score: -100
Wrong Answer
time: 5ms
memory: 3600kb
input:
10000 3 5 5 3 5 4 5 3 1 4 3 1 1 3 3 1 6 3 3 4 4 3 3 4 1 3 1 1 3 5 6 6 3 1 3 3 4 5 1 5 6 5 3 6 2 4 4 6 1 3 4 6 4 4 2 4 3 6 4 1 6 4 6 3 2 4 6 4 2 3 3 2 4 1 5 5 4 3 1 3 6 5 1 1 3 3 2 1 5 3 1 3 6 6 6 2 2 5 3 1 5 2 5 3 3 3 1 3 3 5 4 5 3 1 3 4 2 4 5 3 3 5 6 2 2 2 3 4 3 3 1 2 6 3 3 3 3 3 6 3 3 4 1 3 6 6 4 ...
output:
Kevin Qingyu Kevin Qingyu Kevin Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Kevin Kevin Qingyu Kevin Kevin Qingyu Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Kevin Kevin Qingyu Kevin Kevin Kevin Qingyu Qingyu ...
result:
wrong answer 1st words differ - expected: 'Qingyu', found: 'Kevin'