#include "grader.h"
void solve(int n)
{
if (n <= 40) {
for (int i = 1; i <= n; ++ i ) {
int x = kth(i);
if (cnt(x) > n/3) {
say_answer(x);
return;
}
}
}
else if (n <= 100) {
for (int i = 1; i <= n; i += 4) {
int x = kth(i);
if (cnt(x) > n/3) {
say_answer(x);
return;
}
}
}
else {
for (int i = 1; i <= n; i += 35) {
int x = kth(i);
if (cnt(x) > n/3) {
say_answer(x);
return;
}
}
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
256 KB |
Output is correct |
2 |
Correct |
11 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
256 KB |
Output is correct |
2 |
Correct |
18 ms |
256 KB |
Output is correct |
3 |
Correct |
11 ms |
256 KB |
Output is correct |
4 |
Correct |
15 ms |
256 KB |
Output is correct |
5 |
Correct |
20 ms |
256 KB |
Output is correct |
6 |
Correct |
21 ms |
256 KB |
Output is correct |
7 |
Correct |
27 ms |
256 KB |
Output is correct |
8 |
Correct |
23 ms |
256 KB |
Output is correct |
9 |
Correct |
21 ms |
256 KB |
Output is correct |
10 |
Correct |
22 ms |
256 KB |
Output is correct |
11 |
Correct |
22 ms |
256 KB |
Output is correct |
12 |
Correct |
18 ms |
256 KB |
Output is correct |
13 |
Correct |
25 ms |
256 KB |
Output is correct |
14 |
Correct |
23 ms |
256 KB |
Output is correct |