# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070852 | JoenPoenMan | Rarest Insects (IOI22_insects) | C++17 | 249 ms | 672 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 k = 0;
vector<int> S;
for (int i = 0; i< n; i++) {
move_inside(i);
if (press_button() == 2) {
move_outside(i);
} else S.push_back(i);
}
k = S.size();
int _n = n, y = 0;
vector<bool> active(n, 1);
while (_n > 20) {
int x = (_n+2*k-1)/(2*k);
for (int i : S) move_outside(i);
S.clear();
for (int i = 0; i< n; i++) if (active[i]) {
move_inside(i);
if (press_button() == x+1) {
move_outside(i);
} else S.push_back(i);
}
if (S.size() < x*k) {
active.assign(n, 0);
_n = 0;
for (int i : S) active[i] = 1, _n++;
} else {
for (int i : S) {
_n -= active[i];
active[i] = 0;
}
y += x;
}
}
int l = 0, h = _n;
while (l < h) {
int x = (l+h+1)/2;
for (int i : S) move_outside(i);
S.clear();
for (int i = 0; i< n; i++) if (active[i]) {
move_inside(i);
if (press_button() == x+1) {
move_outside(i);
} else S.push_back(i);
}
if (S.size() < x*k) {
h = x-1;
} else {
l = x;
}
}
return y+l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |