#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
int arr[1005];
void solve(int n)
{
for(int i=1;i<=50;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 |
Incorrect |
13 ms |
200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
36 ms |
200 KB |
Output is partially correct |
2 |
Correct |
5 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
35 ms |
200 KB |
Output is partially correct |
2 |
Partially correct |
57 ms |
200 KB |
Output is partially correct |
3 |
Correct |
7 ms |
200 KB |
Output is correct |
4 |
Correct |
5 ms |
200 KB |
Output is correct |
5 |
Partially correct |
38 ms |
200 KB |
Output is partially correct |
6 |
Partially correct |
42 ms |
200 KB |
Output is partially correct |
7 |
Partially correct |
26 ms |
200 KB |
Output is partially correct |
8 |
Partially correct |
38 ms |
200 KB |
Output is partially correct |
9 |
Partially correct |
55 ms |
200 KB |
Output is partially correct |
10 |
Partially correct |
31 ms |
200 KB |
Output is partially correct |
11 |
Partially correct |
41 ms |
200 KB |
Output is partially correct |
12 |
Partially correct |
13 ms |
288 KB |
Output is partially correct |
13 |
Partially correct |
32 ms |
272 KB |
Output is partially correct |
14 |
Partially correct |
36 ms |
200 KB |
Output is partially correct |