#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n)
{
int Q = 25 + 5*(n > 50);
Q = min(Q, n);
for (int query = 0; query<Q; query++)
{
int i;
i = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
i = abs(i), i %= n, i++;
i = kth(i);
if (cnt(i) > n/3)
{
say_answer(i);
return;
}
}
say_answer(-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
208 KB |
Output is correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
208 KB |
Output is correct |
2 |
Correct |
23 ms |
208 KB |
Output is correct |
3 |
Correct |
7 ms |
208 KB |
Output is correct |
4 |
Correct |
6 ms |
208 KB |
Output is correct |
5 |
Correct |
24 ms |
208 KB |
Output is correct |
6 |
Correct |
18 ms |
208 KB |
Output is correct |
7 |
Correct |
23 ms |
208 KB |
Output is correct |
8 |
Correct |
25 ms |
208 KB |
Output is correct |
9 |
Correct |
25 ms |
208 KB |
Output is correct |
10 |
Correct |
25 ms |
208 KB |
Output is correct |
11 |
Correct |
17 ms |
208 KB |
Output is correct |
12 |
Correct |
16 ms |
208 KB |
Output is correct |
13 |
Correct |
29 ms |
208 KB |
Output is correct |
14 |
Correct |
24 ms |
208 KB |
Output is correct |