Submission #760778

#TimeUsernameProblemLanguageResultExecution timeMemory
760778voliaanykCONSUL (info1cup19_consul)C++14
100 / 100
26 ms284 KiB
#include "bits/stdc++.h" #include "grader.h" using namespace std; #define DIM 100007 #define DIM2 2007 #define fi first #define se second #define mod 1000000007 typedef long long ll; typedef long double ld; typedef pair<ll, ll> pll; void solve(int n){ int w = -1; set<int> s; int p = 20; if(n>100) p = 29; for(int i=1;i<=p;i++){ if(i>n) break; int x = rand()%n + 1; while(s.count(x)!=0){ x = rand()%n + 1; } s.insert(x); x = kth(x); int c = cnt(x); if(c>n*1.0/3){ w = x; break; } } say_answer(w); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...