#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n){
map <int,bool> m;
int x;
srand(time(0)); int q=0;
while (q<min(n,30)){
x=rand()%n+1;
if (m[x]) continue;
q++; m[x]=1; x=kth(x);
if (cnt(x)>n/3){
say_answer(x); return;
}
}
say_answer(-1); return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
344 KB |
Output is correct |
2 |
Correct |
4 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
344 KB |
Output is correct |
2 |
Correct |
9 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
5 |
Correct |
11 ms |
344 KB |
Output is correct |
6 |
Correct |
15 ms |
344 KB |
Output is correct |
7 |
Correct |
10 ms |
344 KB |
Output is correct |
8 |
Correct |
14 ms |
344 KB |
Output is correct |
9 |
Correct |
9 ms |
344 KB |
Output is correct |
10 |
Correct |
14 ms |
344 KB |
Output is correct |
11 |
Correct |
14 ms |
344 KB |
Output is correct |
12 |
Correct |
8 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
344 KB |
Output is correct |
14 |
Correct |
14 ms |
344 KB |
Output is correct |