# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057802 | fuad27 | Rarest Insects (IOI22_insects) | C++17 | 47 ms | 1376 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 distcnt = 0;
set<int> idxs;
for(int i = 0;i<N;i++) {
move_inside(i);
if(press_button() <= 1){
idxs.insert(i);
distcnt++;
continue;
}
move_outside(i);
}
set<int> all_idxs[N+1];
all_idxs[1] = idxs;
int ans=1;
int prev = 1;
int lo = 2, hi = N/distcnt;
while(lo <= hi) {
int mid = (lo+hi)/2;
if(prev < mid) {
for(int j = 0;j<N;j++) {
if(idxs.find(j)!=idxs.end())continue;
move_inside(j);
if(press_button() <= mid) {
idxs.insert(j);
continue;
}
move_outside(j);
}
}
else {
int cur = 1;
for(int j = 1;j<mid;j++) {
if(all_idxs[j].size() > all_idxs[cur].size()) {
cur=j;
}
}
vector<int> er;
for(int j:idxs) {
if(all_idxs[cur].find(j)==all_idxs[cur].end()) {
er.push_back(j);
}
}
int curn=0;
for(int j = mid+1;j<N;j++) {
if(all_idxs[j].size()) {
cur=j;
break;
}
}
for(int j:er){
move_outside(j);
idxs.erase(j);
if(press_button() <= mid)break;
}
for(int j = 0;j<N;j++) {
if(idxs.find(j)!=idxs.end())continue;
if(all_idxs[cur].find(j)==all_idxs[cur].end())continue;
move_inside(j);
if(press_button() <= mid) {
idxs.insert(j);
continue;
}
move_outside(j);
}
}
if(idxs.size() == distcnt*mid) {
lo = mid+1;
ans=mid;
}
else {
hi=mid-1;
}
all_idxs[mid] = idxs;
prev=mid;
}
return ans;
}
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... |