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;
vector<int> uniqu;
vector<int> insects;
int N;
bool check_num(int num) {
//printf("num: %d\n", num);
vector<bool> used(N, false);
for (int i = 0; i < int(insects.size()); i++) {
move_inside(insects[i]);
if (press_button() >= num) {
move_outside(insects[i]);
continue;
}
used[i] = true;
}
bool valid = true;
for (int i = 0; i < int(uniqu.size()); i++) {
move_inside(uniqu[i]);
if (press_button() != num) {
move_outside(uniqu[i]);
valid = false;
break;
}
move_outside(uniqu[i]);
}
for (int i = 0; i < N; i++) {
if (used[i]) {
move_outside(i);
}
}
//printf("valid: %d\n", int(valid));
return valid;
}
int min_cardinality(int n) {
N = n;
int types = 0;
for (int i = 0; i < N; i++) {
move_inside(i);
if (press_button() > 1) {
move_outside(i);
insects.push_back(i);
continue;
}
types++;
uniqu.push_back(i);
}
for (int i = 0; i < int(uniqu.size()); i++) {
move_outside(uniqu[i]);
}
int l = 1;
int r = N+1;
while (l < r) {
int m = (l+r)/2;
if (check_num(m)) {
l = m+1;
} else {
r = m;
}
}
return r-1;
/*for (int i = 1; i <= N/types; i++) {
if (!check_num(i)) {
return i-1;
}
}
return N/types;*/
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |