# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
809030 | BT21tata | Rarest Insects (IOI22_insects) | C++17 | 0 ms | 0 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 uni, n;
bool inside[2005], never[2005];
bool check(int x)
{
if(x==1) return 1;
for(int i=0; i<n; i++)
{
if(!inside[i] and !never[i])
{
move_inside(i);
int cur=press_button();
if(cur>x) move_outside(i);
else inside[i]=1;
}
}
int cnt=0;
for(int i=0; i<n; i++)
cnt+=(inside[i]==1);
if(x*uni==cnt) return 1;
return 0;
}
int min_cardinality(int N)
{
n=N;
for(int i=0; i<n; i++)
{
move_inside(i);
int x=press_button();
if(x==2) move_outside(i);
else inside[i]=1;
else uni++;
}
for(int i=0; i<n; i++)
{
if(inside[i]) move_outside(i);
inside[i]=0;
}
int l=1, r=n/uni;
while(l<=r)
{
int mid=(l+r)>>1;
if(check(mid)) l=mid+1;
else
{
r=mid-1;
for(int i=0; i<n; i++)
{
if(!inside[i]) never[i]=1;
else inside[i]=0, move_outside(i);
}
}
}
return r;
}