QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#393001#8549. The Gameucup-team2894WA 2ms3672kbC++20423b2024-04-18 02:32:522024-04-18 02:32:52

Judging History

你现在查看的是最新测评结果

  • [2024-04-18 02:32:52]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3672kb
  • [2024-04-18 02:32:52]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e6 + 10;
int nums[maxn];
void solve() {
int n;
cin >> n;

for(int i=0;i<2*n;i++){
int x;
cin >> x;
nums[x]++;
}
int tot = 0;
for(int i=0;i<maxn;i++) {
tot += max(nums[i]-1,0);
}
if(tot<=n-1)cout << "Kevin\n";
else cout << "Qingyu\n";
}

int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int tc;
cin >> tc;
while(tc--)
solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 2ms
memory: 3672kb

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
Qingyu
Qingyu

result:

wrong answer 2nd words differ - expected: 'Kevin', found: 'Qingyu'