Submission #390245

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