# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078263 | Faisal_Saqib | Rarest Insects (IOI22_insects) | C++17 | 739 ms | 21788 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 <bits/stdc++.h>
using namespace std;
void move_inside(int i);
void move_outside(int i);
int press_button();
set<int> machine,rem,real_;
void add(int x)
{
if(machine.find(x)==machine.end())
{
machine.insert(x);
}
}
void remp(int x)
{
if(machine.find(x)!=machine.end())
{
machine.erase(x);
}
}
map<vector<int>,int> store;
int ask()
{
vector<int> cur(begin(machine),end(machine));
if(store.find(cur)!=store.end())
return store[cur];
for(auto&i:real_)
if(machine.find(i)==machine.end())
move_outside(i);
for(auto&i:machine)
if(real_.find(i)==real_.end())
move_inside(i);
real_=machine;
return store[cur]=press_button();
}
int min_cardinality(int n)
{
add(0);
for(int i=1;i<n;i++)
{
add(i);
if(ask()>1)
{
rem.insert(i);
remp(i);
}
}
int sz=machine.size();
int s=1;
int e=(n/sz)+1;
while(s+1<e)
{
int mid=(s+e)/2;
vector<int> cur;
for(auto&i:rem)
{
if(machine.size()==(sz*mid))
break;
add(i);
if(ask()>mid)
{
remp(i);
}
else
{
cur.push_back(i);
if(machine.size()==(sz*mid))
break;
}
}
if(machine.size()==((sz*mid)))
{
s=mid;
for(auto&i:cur)
rem.erase(i);
}
else{
e=mid;
rem.clear();
for(auto&i:cur)
{
rem.insert(i);
remp(i);
}
}
}
return s;
}
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... |