#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
int arr[1005];
void solve(int n)
{
for(int i=1;i<=25;i++){
int x=rand()%n+1;
if(arr[x]){
i--;
continue;
}
int a=kth(x);
int say=cnt(a);
if(say>n/3){
say_answer(a);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
200 KB |
Output is correct |
2 |
Correct |
7 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
200 KB |
Output is correct |
2 |
Correct |
21 ms |
200 KB |
Output is correct |
3 |
Correct |
6 ms |
200 KB |
Output is correct |
4 |
Correct |
7 ms |
200 KB |
Output is correct |
5 |
Correct |
17 ms |
200 KB |
Output is correct |
6 |
Correct |
17 ms |
200 KB |
Output is correct |
7 |
Correct |
14 ms |
200 KB |
Output is correct |
8 |
Correct |
28 ms |
200 KB |
Output is correct |
9 |
Correct |
18 ms |
200 KB |
Output is correct |
10 |
Correct |
18 ms |
200 KB |
Output is correct |
11 |
Correct |
17 ms |
200 KB |
Output is correct |
12 |
Correct |
20 ms |
200 KB |
Output is correct |
13 |
Correct |
18 ms |
200 KB |
Output is correct |
14 |
Correct |
25 ms |
200 KB |
Output is correct |