# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627621 | ollel | Rarest Insects (IOI22_insects) | 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 <stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
int query() {
return use_machine();
}
vi perm;
set<int> in;
void add(int x) {
if (in.find(x) != in.end()) return;
in.insert(x);
move_inside(perm[x]);
}
void rem(int x) {
if (in.find(x) == in.end()) return;
in.erase(x);
move_outside(perm[x]);
}
int min_cardinality(int n) {
perm.resize(n);
rep(i,0,n) perm[i] = i;
auto rng = std::default_random_engine {};
shuffle(perm.begin(), perm.end(), rng);
rep(i,0,n) {
add(i);
if (query() > 1) rem(i);
}
int types = in.size();
int low = 1, high = n / types + 1, mid;
vb never(n, false), always(n, false);
while (high - low > 1) {
mid = (low + high) / 2;
rep(i,0,n) {
if (never[i]) continue;
add(i);
if (query() > mid) rem(i);
}
if (in.size() == mid * types) {
low = mid;
for (auto i : in) always[i] = true;
} else {
high = mid;
rep(i,0,n) if (in.find(i) == in.end()) never[i] = true;
rep(i,0,n) if (!always[i]) rem(i);
}
}
return mid;
}