#include <bits/stdc++.h>
using namespace std;
int kth(int i);
int cnt(int x);
void say_answer(int a);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(int n){
for(int i=0;i<50;i++){
int x=kth(rng()%n+1);
int g=cnt(x);
if(g>n/3){
say_answer(x);
return;
}
}
say_answer(-1);
return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
15 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
22 ms |
208 KB |
Output is partially correct |
2 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
26 ms |
208 KB |
Output is partially correct |
2 |
Partially correct |
29 ms |
208 KB |
Output is partially correct |
3 |
Correct |
5 ms |
296 KB |
Output is correct |
4 |
Correct |
5 ms |
208 KB |
Output is correct |
5 |
Partially correct |
28 ms |
256 KB |
Output is partially correct |
6 |
Partially correct |
28 ms |
208 KB |
Output is partially correct |
7 |
Partially correct |
27 ms |
208 KB |
Output is partially correct |
8 |
Partially correct |
38 ms |
208 KB |
Output is partially correct |
9 |
Partially correct |
37 ms |
208 KB |
Output is partially correct |
10 |
Partially correct |
33 ms |
208 KB |
Output is partially correct |
11 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |
12 |
Partially correct |
18 ms |
292 KB |
Output is partially correct |
13 |
Partially correct |
34 ms |
208 KB |
Output is partially correct |
14 |
Partially correct |
31 ms |
296 KB |
Output is partially correct |