#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(int n) {
for(int i = 1; i <= 25; i++) {
int pos = (rng() % n) + 1;
pos = kth(pos);
if(cnt(pos) > n / 3) {
say_answer(pos);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
364 KB |
Output is correct |
2 |
Correct |
8 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
364 KB |
Output is correct |
2 |
Correct |
20 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
8 ms |
364 KB |
Output is correct |
5 |
Correct |
27 ms |
364 KB |
Output is correct |
6 |
Correct |
27 ms |
364 KB |
Output is correct |
7 |
Correct |
27 ms |
364 KB |
Output is correct |
8 |
Correct |
19 ms |
364 KB |
Output is correct |
9 |
Correct |
25 ms |
364 KB |
Output is correct |
10 |
Correct |
21 ms |
364 KB |
Output is correct |
11 |
Correct |
17 ms |
492 KB |
Output is correct |
12 |
Correct |
19 ms |
364 KB |
Output is correct |
13 |
Correct |
13 ms |
364 KB |
Output is correct |
14 |
Correct |
19 ms |
364 KB |
Output is correct |