Submission #486316

#TimeUsernameProblemLanguageResultExecution timeMemory
486316NintsiChkhaidzeCONSUL (info1cup19_consul)C++14
15.00 / 100
51 ms284 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int kth(int k); void say_answer(int k); int cnt(int k); map <int,int> mp; void solve(int n){ if (n<=50){ mp.clear(); for (int i = 1; i <= n; i++){ int val = kth(i); mp[val]++; if (mp[val] > n/3){ say_answer(val); return; } } say_answer(-1); return; } int r=0; set <int> st; st.clear(); for (int i = 1; i <= n; i++){ int id = rand()%n + 1; int val = kth(id); if (st.find(val)!=st.end()) continue; r++; if (r==60) break; st.insert(val); if (cnt(val) > n/3){ say_answer(val); return; } r++; if (r==60) break; } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...