Submission #390233

#TimeUsernameProblemLanguageResultExecution timeMemory
390233mariowongCONSUL (info1cup19_consul)C++14
0 / 100
1 ms288 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; int val,pos,ct; map <int,int> m; void solve(int n){ mt19937 gen(time(NULL)); uniform_int_distribution <int> dis(1,1e9); while (ct+2 <= 60){ pos=dis(gen)%n+1; val=kth(pos); if (m[val]) ct++; else { m[val]=true; if (cnt(val) > n/3){ say_answer(val); return; } ct+=2; } } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...