#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int n;
int sz = 0;
set<int> rem;
void putin(int x) {
move_inside(x);
sz++;
}
void putout(int x) {
move_outside(x);
sz--;
}
int val() {
return press_button();
}
int min_cardinality(int N) {
n = N;
putin(0);
for (int i = 1;i < n;i++) {
putin(i);
if (val() == 2) {
putout(i);
rem.insert(i);
}
}
int type = sz;
if (type == n) return 1;
int l = 1, r = n / type;
while (l < r) {
int mid = (l + r + 1) / 2;
set<int> in;
stack<int> st;
for (auto& x : rem) {
putin(x);
in.insert(x);
st.push(x);
if (sz > type * mid) {
while (!st.empty()) {
putout(st.top());
in.erase(st.top());
st.pop();
if (val() <= mid) break;
}
}
}
if (sz == type * mid) {
for (auto& x : in) {
rem.erase(x);
}
l = mid;
}
else {
for (auto& x : in) {
putout(x);
}
r = mid - 1;
}
}
return l;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Incorrect |
4 ms |
604 KB |
Wrong answer. |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Incorrect |
4 ms |
604 KB |
Wrong answer. |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong answer. |
2 |
Halted |
0 ms |
0 KB |
- |