# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057082 | vjudge1 | 드문 곤충 (IOI22_insects) | C++17 | 36 ms | 848 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;
using vi = vector<int>;
using ii = pair<int, int>;
int min_cardinality(int n) {
int d = 0;
vi Cul;
for(int i = 0; i < n; ++i) {
move_inside(i);
if(press_button() == 1) {
Cul.push_back(i);
++d;
}
else move_outside(i);
}
for(auto it : Cul) move_outside(it);
int re = 0;
int st = 0, dr = n / d, mij;
set<int> S;
for(int i = 0; i < n; ++i) S.insert(i);
while(st < dr) {
mij = (st + dr + 1) / 2;
if(d > S.size()) {
st = dr = 0;
break; // exista 0!
}
set<int> I;
for(auto it : S) {
move_inside(it);
if(press_button() == mij + 1) {
move_outside(it);
} else {
I.insert(it);
}
}
if(I.size() == d * mij) {
for(auto it : I) {
S.erase(it);
}
re += mij;
st = 0;
dr = dr - mij;
} else {
dr = mij - 1;
S = I;
}
for(auto it : I) move_outside(it);
}
return re + st;
}
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... |