#include "grader.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void solve(int n)
{
set<ll> s;
srand(42069);
while(s.size() < 29){
int i = rand() % n + 1;
if(!s.count(i)){
s.insert(i);
ll val = kth(i);
if(cnt(val) > n / 3){
say_answer(val);
return;
}
}
}
say_answer(cnt(kth(1)) > n / 3 ? kth(1) : -1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
492 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
364 KB |
Output is correct |
2 |
Correct |
8 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
364 KB |
Output is correct |
2 |
Correct |
22 ms |
364 KB |
Output is correct |
3 |
Correct |
7 ms |
364 KB |
Output is correct |
4 |
Correct |
8 ms |
364 KB |
Output is correct |
5 |
Correct |
23 ms |
364 KB |
Output is correct |
6 |
Correct |
27 ms |
364 KB |
Output is correct |
7 |
Correct |
24 ms |
364 KB |
Output is correct |
8 |
Correct |
29 ms |
364 KB |
Output is correct |
9 |
Correct |
22 ms |
364 KB |
Output is correct |
10 |
Correct |
31 ms |
364 KB |
Output is correct |
11 |
Correct |
27 ms |
364 KB |
Output is correct |
12 |
Correct |
23 ms |
364 KB |
Output is correct |
13 |
Correct |
29 ms |
364 KB |
Output is correct |
14 |
Correct |
20 ms |
364 KB |
Output is correct |