# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627807 | Fischer | 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 <bits/stdc++.h>
#include "insects.h"
using namespace std;
const int maxn = 2010;
int in[maxn];
vector<bool> memo;
int n;
void put(int x) {
memo[x] = 1;
}
void pop(int x) {
memo[x] = 0;
}
map<vector<bool>, int> mapMemo;
bool last[maxn];
int push() {
if (mapMemo.contains(memo)) return mapMemo[memo];
for (int i = 0; i < n; ++i) {
if (last[i] != (in[i] != 0)) {
if (last[i]) move_outside(i);
else move_inside(i);
last[i] ^= 1;
}
}
return mapMemo[memo] = press_button();
}
bool p(int x) {
int len = c;
for (int i = 0; i < n; ++i) {
if (in[i] == -1) continue;
put(i);
in[i] = 1;
if (push() > x) {
pop(i);
in[i] = 0;
} else {
len += 1;
}
}
for (int i = 0; i < n; ++i) {
if (in[i] == 1) {
pop(i);
in[i] = 0;
}
}
return len == x * c;
}
int min_cardinality(int N) {
n = N;
memo.assign(n, 0);
c = 0;
for (int i=0; i<N; ++i) {
put(i);
in[i] = -1;
if (push() == 1) c += 1;
else pop(i);
}
if (c == 1) return N;
if (c == N) return 1;
int lo = 2, hi = N / c;
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
if (p(mid, N)) lo = mid;
else hi = mid-1;
}
return lo;
}