#include "grader.h"
#include "bits/stdc++.h"
#define fi first
#define se second
#define pb push_back
#define ll long long
using namespace std;
map<int,int>m;
void solve(int n)
{
for(int i=1;i<=20;i++)
{
int w=rand();
w%=n;w++;
int x=kth(w);
int y=cnt(x);
if(y>n/3)
{
say_answer(x);return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
364 KB |
Output is correct |
2 |
Correct |
7 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
364 KB |
Output is correct |
2 |
Correct |
20 ms |
364 KB |
Output is correct |
3 |
Correct |
4 ms |
364 KB |
Output is correct |
4 |
Correct |
8 ms |
364 KB |
Output is correct |
5 |
Correct |
19 ms |
364 KB |
Output is correct |
6 |
Correct |
10 ms |
364 KB |
Output is correct |
7 |
Correct |
18 ms |
364 KB |
Output is correct |
8 |
Correct |
15 ms |
364 KB |
Output is correct |
9 |
Correct |
21 ms |
364 KB |
Output is correct |
10 |
Correct |
17 ms |
364 KB |
Output is correct |
11 |
Incorrect |
5 ms |
364 KB |
Wrong answer |
12 |
Halted |
0 ms |
0 KB |
- |