# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786331 | vjudge1 | 수천개의 섬 (IOI22_islands) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
int cnt = 0;
vector<bool> f(N);
for (int i = 0; i < N; i++) {
move_inside(i);
if (press_button() <= 1) {
f[i] = 1;
cnt++;
} else {
move_outside(i);
}
}
for (int i = 0; i < N; i++) {
if (f[i]) {
move_outside(i);
}
}
int lo = 1, hi = N;
while (lo < hi) {
int mi = (lo + hi + 1) / 2, in = 0;
for (int i = 0; i < N; i++) {
move_inside(i);
if (press_button() <= mi) {
in++;
f[i] = 1;
} else {
move_outside(i);
}
}
for (int i = 0; i < N; i++) {
if (f[i]) {
move_outside(i);
}
}
if (in == mi * cnt) {
lo = mi;
} else {
hi = mi - 1;
}
}
return lo;
}