#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){
set <int> st; st.clear();
for (int i = 1; i <= n; i++){
int val = kth(i);
if (st.find(val)!=st.end())
continue;
st.insert(val);
if (cnt(val) > n/3)
say_answer(val);
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Multiple answers provided for the same testcase! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
200 KB |
Multiple answers provided for the same testcase! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
268 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |