#include "grader.h"
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define epb emplace_back
#define inf 1e9+1
#define linf 1e18+1
using namespace std;
void solve(int n)
{
srand(time(NULL));
for(int j=0;j<25;j++){
int x=rand()%n+1;
int f=kth(x);
int v=cnt(f);
if(v>n/3){say_answer(f);return;}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
200 KB |
Output is correct |
2 |
Correct |
7 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
200 KB |
Output is correct |
2 |
Correct |
16 ms |
200 KB |
Output is correct |
3 |
Correct |
7 ms |
200 KB |
Output is correct |
4 |
Correct |
7 ms |
200 KB |
Output is correct |
5 |
Correct |
18 ms |
200 KB |
Output is correct |
6 |
Correct |
22 ms |
200 KB |
Output is correct |
7 |
Correct |
20 ms |
200 KB |
Output is correct |
8 |
Correct |
24 ms |
200 KB |
Output is correct |
9 |
Correct |
22 ms |
200 KB |
Output is correct |
10 |
Correct |
21 ms |
200 KB |
Output is correct |
11 |
Correct |
22 ms |
200 KB |
Output is correct |
12 |
Correct |
21 ms |
200 KB |
Output is correct |
13 |
Correct |
9 ms |
200 KB |
Output is correct |
14 |
Correct |
15 ms |
200 KB |
Output is correct |