Submission #502091

#TimeUsernameProblemLanguageResultExecution timeMemory
502091bigoCONSUL (info1cup19_consul)C++14
0 / 100
1 ms268 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; void solve(int n){ map<int, int>his; set<int>vec; for (int i = 0; i < n; i++) { int k = kth(i); his[k]++; vec.insert(k); } for (auto u : vec) { if (his[u] >= n / 3) say_answer(u); } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...