#include "grader.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void solve(int n){
vector<int> inds;
for(int i=1;i<=n;i++)inds.push_back(i);
//~ mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//~ shuffle(inds.begin(), inds.end(), rng);
//~ srand(time(NULL));
//~ random_shuffle(inds.begin(),inds.end());
int numq = min(n/3+1,30);
for(int i=0;i<numq;i++){
int x = kth(inds[i]);
int c = cnt(x);
if(c > n/3){
say_answer(x);
return;
}
}
say_answer(-1);
return;
}
/*
2
9
4 2 3 4 1 2 5 4
9
4 2 3 4 4 2 5 4
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
9 ms |
364 KB |
Wrong answer |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
32 ms |
364 KB |
Output is correct |
2 |
Incorrect |
2 ms |
364 KB |
Wrong answer |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
364 KB |
Output is correct |
2 |
Correct |
24 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Wrong answer |
4 |
Halted |
0 ms |
0 KB |
- |