#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int kth(int k);
void say_answer(int k);
int cnt(int k);
void solve(int n)
{
int i, pos;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 mt_rand(seed);
auto yay = bind(uniform_int_distribution<int> (1, n), mt_rand);
for(i=1; i<=25; ++i)
{
pos = yay();
pos = kth(pos);
if(cnt(pos) > n/3)
{
say_answer(pos);
return;
}
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
248 KB |
Output is correct |
2 |
Correct |
11 ms |
248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
25 ms |
248 KB |
Output is correct |
2 |
Correct |
24 ms |
276 KB |
Output is correct |
3 |
Correct |
12 ms |
248 KB |
Output is correct |
4 |
Correct |
12 ms |
296 KB |
Output is correct |
5 |
Correct |
25 ms |
248 KB |
Output is correct |
6 |
Correct |
28 ms |
292 KB |
Output is correct |
7 |
Correct |
25 ms |
376 KB |
Output is correct |
8 |
Correct |
22 ms |
248 KB |
Output is correct |
9 |
Correct |
30 ms |
248 KB |
Output is correct |
10 |
Correct |
24 ms |
248 KB |
Output is correct |
11 |
Correct |
30 ms |
248 KB |
Output is correct |
12 |
Correct |
22 ms |
248 KB |
Output is correct |
13 |
Correct |
31 ms |
248 KB |
Output is correct |
14 |
Correct |
35 ms |
248 KB |
Output is correct |