Submission #524276

#TimeUsernameProblemLanguageResultExecution timeMemory
524276maks007CONSUL (info1cup19_consul)C++14
85 / 100
37 ms384 KiB
#include <bits/stdc++.h> #include <map> #include "grader.h" using namespace std; void solve(int n) { srand(time(0)); map <int,int> mp; vector <int> used(n); set <int> s; for(int i = 0; i< n; i ++) s.insert(i); for(int i = 0; i < 30; i ++) { int val = rand() % n; int k = kth(val+1); if(cnt(k) > n/3) { say_answer(k); return; } mp[k] ++; } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...