#include "grader.h"
#include "bits/stdc++.h"
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
void solve(int n)
{
/// insert your code
/// for example
for(int i=0; i<24; i++) {
int x = rnd(1, n);
int kk = kth(x);
if(cnt(kk) > n/3) {
say_answer(kk); return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
208 KB |
Output is correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
288 KB |
Output is correct |
2 |
Correct |
21 ms |
208 KB |
Output is correct |
3 |
Correct |
7 ms |
292 KB |
Output is correct |
4 |
Correct |
7 ms |
208 KB |
Output is correct |
5 |
Correct |
13 ms |
208 KB |
Output is correct |
6 |
Correct |
18 ms |
300 KB |
Output is correct |
7 |
Correct |
23 ms |
208 KB |
Output is correct |
8 |
Correct |
24 ms |
296 KB |
Output is correct |
9 |
Correct |
8 ms |
300 KB |
Output is correct |
10 |
Correct |
9 ms |
292 KB |
Output is correct |
11 |
Correct |
17 ms |
296 KB |
Output is correct |
12 |
Correct |
15 ms |
300 KB |
Output is correct |
13 |
Correct |
32 ms |
292 KB |
Output is correct |
14 |
Correct |
22 ms |
208 KB |
Output is correct |