# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819313 | andrei_boaca | Rarest Insects (IOI22_insects) | C++17 | 106 ms | 296 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>
//#include "stub.cpp"
using namespace std;
int cul[2005];
int n;
vector<int> spec;
struct date
{
int nod,l,r;
};
vector<date> need;
bool comp(date a, date b)
{
return a.l<b.l;
}
bool use[2005];
int f[2005];
int min_cardinality(int N)
{
n=N;
cul[0]=1;
spec.push_back(0);
move_inside(0);
int nr=1;
for(int i=1;i<n;i++)
{
move_inside(i);
int cnt=press_button();
if(cnt>=2)
move_outside(i);
else
{
nr++;
cul[i]=nr;
spec.push_back(i);
}
}
int D=nr;
int B=n/D;
int loga=0;
for(int i=0;i<20;i++)
if((1<<i)<=B)
loga=i;
int I=0;
while(true)
{
B=n/D;
for(int i=0;i<n;i++)
{
move_inside(i);
use[i]=1;
I++;
if(press_button()>B)
{
I--;
use[i]=0;
move_outside(i);
}
}
if(I==B*D)
return B;
int aux=I;
for(int i=0;i<n;i++)
if(use[i])
{
I--;
move_outside(i);
use[i]=0;
}
n=aux;
}
}
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... |