#include "insects.h"
#include "bits/stdc++.h"
#define SZ(s) ((int) s.size())
using namespace std;
#ifndef RR
#define DEBUG(X)
#endif
mt19937_64 rng(58);
int min_cardinality(int n) {
std::set<int> insides; // set of insects inside machine
std::vector<int> order(n);
std::iota(order.begin(), order.end(), 0);
shuffle(order.begin(), order.end(), rng);
// lambda functions {{{
// lambda function to add one insect to machine
auto add = [&] (int i) { move_inside(order[i]); insides.insert(i); };
// lambda function to remove one insect from machine
auto remove = [&] (int i) { move_outside(order[i]); insides.erase(i); };
// }}}
// machine_states(f) = set of insects inside machine after we
// binary search with value f
std::map<int, std::set<int>> machine_states;
// Step 1: Find set containing unique insects {{{
for (int i = 0; i < n; ++i) {
add(i);
if (press_button() > 1) { // this species appeared before
remove(i);
}
}
int unique_vals = SZ(insides);
DEBUG(unique_vals);
// }}}
std::set<int> candidates;
for (int i = 0; i < n; ++i) if (!insides.count(i)) candidates.insert(i);
// Step 2: Binary search for min f
int l = 2, r = n / unique_vals, res = 1;
while (l <= r) {
int mid = (l + r) / 2;
std::set<int> just_added, just_removed;
for (int i : candidates) if (!insides.count(i)) {
add(i);
if (press_button() > mid) {
remove(i);
just_removed.insert(i);
} else {
just_added.insert(i);
}
}
int total = SZ(insides);
machine_states[mid] = insides;
if (total >= unique_vals * mid) {
res = mid;
l = mid + 1;
candidates = just_removed;
} else {
r = mid - 1;
for (int i : just_added) {
remove(i);
}
candidates = just_added;
}
}
return res;
}
