Submission #1089793

#TimeUsernameProblemLanguageResultExecution timeMemory
1089793LilPlutonCONSUL (info1cup19_consul)C++14
100 / 100
16 ms856 KiB
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int>v;
int l, c = 0, ans;
void solve(int N){
    n = N;
    v.assign(n + 1, 0);
    l = 60;
    c = 0;
    ans = -1;
    while(l && c * 2 <= n){
        l--;
        if(!l){
            return;
        }
        int x = rand() % n + 1;
        while(v[x]){
            x = rand() % n + 1;
        }
        v[x] = 1;
        int u = kth(x);
        int cc = cnt(u);
        if(cc * 3 > n){
            ans = u;break;
        }
        ++c;
        l--;
    }
    say_answer(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...