QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#437913#8549. The Gamewifi32767WA 0ms3808kbC++205.2kb2024-06-09 19:54:402024-06-09 19:54:41

Judging History

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

  • [2024-06-09 19:54:41]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3808kb
  • [2024-06-09 19:54:40]
  • 提交

answer

/*
                                       ____
                                          /|  |  |  |  l
                                     厂l  |  |  |  |
                                     | |  |  |  |  |
                                     | |_|_|_|_|
                                     { 个__o__}
                                     /|:i:厂\:i:i:i:i:i/^㍉
   八                                ./:i:|//¨ヽ  ̄ 彡、}
  i{  \                              .'/ハ|  艾_0  /<07|Y
  ,i{    寸                           .i人__|      {:.   |ノ
  i{      寸                           |:i:i:i:i:i:       /:.  ,'|
 ,i{        寸                             |:i:i:i:i八  /──-〉 /i|      那么开始投下
 ,i{         寸                       乂:i:i:i:| \     ./:iノ
 .i{          V                         .才:|   ≧寸彡ニ\
                 V                        .斗チ/ニl|    /ニニ    ー-
   乂       -─<{                      /   .|ニニ||   ./ニニ.     /  .V
     ` <   ∧ 寸厂V               /    .|ニニ||   /ニニ      /     ∨/
           ̄\ \ 寸              /      |ニニ||  //ニニ     /       ∨/
            / >v \            / .|    |ニニ|| .//ニニ     |       .V/
          / /./ 〉ハ',          /  |    |ニニ||//ニニ.      |        .∨/
          .{  / / ∨.|ニ\       /   |    |ニニ||/ニニ        |          ∨/
          .\. / /Vノニニ.\   ./     |    |ニニ|ニニ       |         ∨/
            \  ∨厂`)ニ.  寸<       .|    |ニニ|ニニ|       |          .∨/
              .\ 乂/ニ    \ \     |  |\|ニニニニニ|.∧       |           ∨/
              |ー::ニニニ      |  |    .|  |二ニニニニニニ|.      |             .∨/
              |ーニニニ            |  ⌒/ニニニ{ 寸     |              ∨/
              |ーニニニ            |   ./二/ Vニ.        |            ∨/
              |ーニニニ             |  /二/  |ニニ       |
              |=ニニニ            |  /二/   .|ニニ       |                                            ┛
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define yes cout << "Yes\n"
#define no cout << "No\n"
// #define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<ll, ll>;
const int MAX = 3e6 + 10;
const ll mod = 1e9 + 7;

ll power(ll a, ll b){
    ll res = 1;
    while (b){
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
void solve(){
    int n; cin >> n;
    n <<= 1;
    vector<int> a(n), cnt(n);
    for (int i = 0; i < n; i++) cin >> a[i], cnt[a[i]] ++;
    int k = 0;
    for (int i = 1; i <= n; i ++){
        if (cnt[i]) k ++;
    }
    if (k > n / 2) cout << "Kevin\n";
    else cout << "Qingyu\n";
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	// cout << fixed << setprecision(12);
    // init();
    int _;cin>>_;while (_ --)
        solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3808kb

input:

3
3
1 1 4 5 1 4
2
1 2 3 4
4
1 2 2 3 2 1 1 4

output:

Kevin
Kevin
Qingyu

result:

wrong answer 1st words differ - expected: 'Qingyu', found: 'Kevin'