# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078093 | Muhammad_Aneeq | Rarest Insects (IOI22_insects) | C++17 | 0 ms | 344 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.
void move_inside(int i);
void move_outside(int i);
int press_button();
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<vector<int>,int>d;
vector<int>ind;
int ask()
{
if (d.find(ind)==d.end())
return d[ind];
d[ind]=press_button();
return d[ind];
}
int min_cardinality(int N)
{
int colors=0;
for (int i=0;i<N;i++)
{
move_inside(i);
ind.push_back(i);
if (ask()==2)
{
move_outside(i);
ind.pop_back();
}
else
colors++;
}
if (colors==1)
return N;
for (auto i:ind)
move_outside(i);
int st=1,en=N/colors+1;
while (st+1<en)
{
int mid=(st+en)/2;
ind={};
for (int i=0;i<N;i++)
{
move_inside(i);
ind.push_back(i);
if (ask()>mid)
{
move_outside(i);
ind.pop_back();
}
}
if (ind.size()==mid*colors)
st=mid;
else
en=mid;
for (auto i:ind)
move_outside(i);
}
return st;
}
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... |