#include <bits/stdc++.h>
#include <grader.h>
using namespace std;
void solve(int n) {
srand(time(NULL));
map<int, int> mp;
while (true) {
int x = rand() % n + 1;
if (mp.find(x) != mp.end()) {
continue;
}
mp[x] = true;
if (cnt(kth(x)) > n / 3) {
say_answer(x);
return;
}
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
296 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |