# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711165 | PoonYaPat | Rarest Insects (IOI22_insects) | C++17 | 57 ms | 412 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;
queue<int> out,in,temp,temp2;
int type;
int min_cardinality(int n) {
for (int i=0; i<n; ++i) {
move_inside(i);
if (press_button()>1) move_outside(i), out.push(i);
else ++type, in.push(i);
}
int l=1,r=n/type;
int cnt=0;
while (l<r) {
int mid=(l+r+1)/2;
//check whether ans is less than mid or not
while (!out.empty()) {
move_inside(out.front());
if (press_button()>mid) move_outside(out.front()), temp2.push(out.front());
else temp.push(out.front());
out.pop();
if (in.size()+temp.size()==type*mid) break;
}
while (!temp2.empty()) {
out.push(temp2.front());
temp2.pop();
}
if (in.size()+temp.size()==type*mid) {
l=mid;
while (!temp.empty()) {
in.push(temp.front());
temp.pop();
}
} else {
r=mid-1;
while (!out.empty()) out.pop();
while (!temp.empty()) {
out.push(temp.front());
move_outside(temp.front());
temp.pop();
}
}
}
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... |