#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
int sum = 0;
unordered_set<int> vs;
for (int i = 1; i <= n; i++) {
if (n-sum < n/3.0) {
say_answer(-1);
return;
}
int x = kth(i);
if (vs.count(x) > 0) {
int s = cnt(x);
if (s > n/3.0) {
say_answer(x);
sum += s;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
82 ms |
200 KB |
Output is correct |
2 |
Correct |
88 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1020 ms |
200 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |