QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#418425#8549. The Gametarjen#RE 0ms3564kbC++20663b2024-05-23 13:51:102024-05-23 13:51:11

Judging History

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

  • [2024-05-23 13:51:11]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3564kb
  • [2024-05-23 13:51:10]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
string solve()
{
    int n;cin>>n;
    vector<int> ma(n+1);
    for(int i=1;i<=2*n;i++){
        int x;cin>>x;
        ma[x]++;
    }
    vector<int> v;
    for(auto &it:ma)if(it>0)v.push_back(it);
    sort(v.begin(),v.end());
    int now=0;
    for(int i=1;i<n;i++){
        if(now+1==(int)v.size())return "Qingyu";
        if(--v.back()==0)v.pop_back();
        if(--v[now]==0)now++;
    }
    if(now+1==(int)v.size())return "Qingyu";
    else return "Kevin";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)cout<<solve()<<"\n";
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3564kb

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
Runtime Error

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:


result: