#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(time(0));
void solve(int N) {
for (int rep = 1; rep <= 25; rep++) {
int pos = rng() % N + 1;
int element = kth(pos);
if (cnt(element) > N / 3) {
say_answer(element);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
200 KB |
Output is correct |
2 |
Correct |
10 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
200 KB |
Output is correct |
2 |
Correct |
22 ms |
200 KB |
Output is correct |
3 |
Correct |
10 ms |
284 KB |
Output is correct |
4 |
Correct |
3 ms |
328 KB |
Output is correct |
5 |
Correct |
24 ms |
200 KB |
Output is correct |
6 |
Correct |
11 ms |
264 KB |
Output is correct |
7 |
Correct |
10 ms |
264 KB |
Output is correct |
8 |
Correct |
26 ms |
200 KB |
Output is correct |
9 |
Correct |
31 ms |
200 KB |
Output is correct |
10 |
Correct |
17 ms |
200 KB |
Output is correct |
11 |
Correct |
34 ms |
200 KB |
Output is correct |
12 |
Correct |
35 ms |
200 KB |
Output is correct |
13 |
Correct |
37 ms |
288 KB |
Output is correct |
14 |
Correct |
22 ms |
200 KB |
Output is correct |