Submission #540650

#TimeUsernameProblemLanguageResultExecution timeMemory
540650Carmel_Ab1CONSUL (info1cup19_consul)C++17
0 / 100
3 ms208 KiB
#include "grader.h"
#include "bits/stdc++.h"

void solve(int n){
    std::vector<int>ord(n);
    for(int i=0; i<n; i++)
        ord[i]=i+1;

    std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
    std::shuffle(ord.begin(),ord.end(),rng);

    for(int i=0; i<std::min(n,30); i++){
        int c=cnt(kth(ord[i]));
        if(c>=(n+2)/3) {
            say_answer(ord[i]);
            return;
        }
    }
    say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...