#include "grader.h"
#include<bits/stdc++.h>
using namespace std ;
mt19937_64 randd(chrono::steady_clock::now().time_since_epoch().count());
void solve(int n)
{
bool ok=1;
for(int i = 1 ;i < 31; i ++ ) {
int ans = kth(randd()%(n)+1) ;
int temp = cnt(ans);
if(temp > n/3 && ok ) {
say_answer(ans) ;
ok=0;break ;
} }
if(ok)
say_answer(-1) ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
344 KB |
Output is correct |
2 |
Correct |
12 ms |
344 KB |
Output is correct |
3 |
Correct |
2 ms |
344 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
5 |
Correct |
7 ms |
344 KB |
Output is correct |
6 |
Correct |
12 ms |
344 KB |
Output is correct |
7 |
Correct |
11 ms |
344 KB |
Output is correct |
8 |
Correct |
18 ms |
344 KB |
Output is correct |
9 |
Correct |
11 ms |
344 KB |
Output is correct |
10 |
Correct |
13 ms |
344 KB |
Output is correct |
11 |
Correct |
15 ms |
344 KB |
Output is correct |
12 |
Correct |
11 ms |
344 KB |
Output is correct |
13 |
Correct |
11 ms |
344 KB |
Output is correct |
14 |
Correct |
12 ms |
344 KB |
Output is correct |