Submission #760775

#TimeUsernameProblemLanguageResultExecution timeMemory
760775voliaanykCONSUL (info1cup19_consul)C++14
0 / 100
1 ms208 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){ bool w = 0; set<int> s; for(int i=1;i<=20;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; } } if(w) say_answer(w); else say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...