# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070091 | Unforgettablepl | Rarest Insects (IOI22_insects) | C++17 | 3064 ms | 1032 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){
vector<int> uniques = {0};
move_inside(0);
vector<bool> isCommon(N);
vector<int> ans(N,-1);
ans[0]=1;
for(int i=1;i<N;i++) {
move_inside(i);
if(press_button()==1) {
uniques.emplace_back(i);
ans[i]=1;
} else {
move_outside(i);
isCommon[i]=true;
}
}
for(int&i:uniques)move_outside(i);
int added = -1;
for(int jump=1024;jump;jump/=2) {
vector<pair<int,int>> queries;
for(int i=0;i<N;i++)if(isCommon[i]) {
if(ans[i]+jump>=uniques.size()-1)continue;
if((ans[i]+1)&(jump<<1))continue;
queries.emplace_back(ans[i]+jump,i);
}
sort(queries.begin(),queries.end());
for(int i=0;i<queries.size();i++) {
auto [x,idx] = queries[i];
while(added<x)move_inside(uniques[++added]);
while(added>x)move_outside(uniques[added--]);
move_inside(idx);
if(press_button()==1) {
ans[idx]=x;
int y = x+1;
queries.emplace_back(x+((y&-y)>>1),idx);
sort(queries.begin(), queries.end());
}
move_outside(idx);
}
}
for(int i=0;i<N;i++)if(isCommon[i])ans[uniques[ans[i]+1]]++;
int siz = N;
for(int i=0;i<N;i++)if(!isCommon[i])siz=min(siz,ans[i]);
return siz;
}
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... |