#include "grader.h"
#include <bits/stdc++.h>
#include <map>
#define ll long long
using namespace std;
void solve(int n){
for(int i=1;i<25;i++){
int nc=kth(rand()%n +1);
int awa=cnt(nc);
if(awa>n/3){
say_answer(nc);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
208 KB |
Output is correct |
2 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
208 KB |
Output is correct |
2 |
Correct |
19 ms |
208 KB |
Output is correct |
3 |
Correct |
5 ms |
208 KB |
Output is correct |
4 |
Correct |
6 ms |
208 KB |
Output is correct |
5 |
Correct |
18 ms |
208 KB |
Output is correct |
6 |
Correct |
19 ms |
208 KB |
Output is correct |
7 |
Correct |
16 ms |
208 KB |
Output is correct |
8 |
Correct |
19 ms |
208 KB |
Output is correct |
9 |
Correct |
18 ms |
208 KB |
Output is correct |
10 |
Correct |
20 ms |
208 KB |
Output is correct |
11 |
Correct |
24 ms |
208 KB |
Output is correct |
12 |
Correct |
12 ms |
208 KB |
Output is correct |
13 |
Correct |
23 ms |
208 KB |
Output is correct |
14 |
Correct |
15 ms |
208 KB |
Output is correct |