Submission #476766

#TimeUsernameProblemLanguageResultExecution timeMemory
476766leakedCONSUL (info1cup19_consul)C++14
0 / 100
2 ms200 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int kth(int k); void say_answer(int k); int cnt(int k); auto rng=bind(uniform_int_distribution<int>(1,1e9),mt19937(time(0))); void solve(int n) { map<int,int> mp; int q=0;int x=-1; int cntt=0; while(q<60 && x==-1 && cntt<(2*n)/3){ int w=kth(rng()%n+1);q++; if(mp.count(w)) continue; int how=cnt(w);cntt+=how; if(how>(n/3)) x=w; } say_answer(x); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...