# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629760 | hltk | Rarest Insects (IOI22_insects) | C++17 | 263 ms | 600 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 <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int min_cardinality(int n) {
int types = 0;
vector<int> y, inds;
for (int i = 0; i < n; ++i) {
move_inside(i);
if (press_button() == 1) {
types++;
y.push_back(i);
} else {
inds.push_back(i);
move_outside(i);
}
}
if (types == 1 || types == n) {
return 1 ^ n ^ types;
}
auto test = [&](int k) {
vector<int> x = y;
for (int i : inds) {
move_inside(i);
if (press_button() > k) {
move_outside(i);
} else {
x.push_back(i);
}
}
for (int i : x) {
if (!binary_search(y.begin(), y.end(), i)) {
move_outside(i);
}
}
return x.size() < k * types;
};
int l = 1, r = n - 1;
while (l < r) {
int m = (l + r) / 2;
if (test(m + 1)) r = m;
else l = m + 1;
}
return 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... |