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;
#include "insects.h"
#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif
#define ll long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N=1e5+5;
const int mod=1e9+7;
int min_cardinality(int n){
set <int> s;
vector <int> nw;
vector <int> p(n);
iota(p.begin(),p.end(),0);
shuffle(p.begin(),p.end(),rng);
map <int,set<int>> mp;
int cad;
auto add = [&](int i) -> void{
if(s.find(i)!=s.end()) return;
s.insert(i);
move_inside(p[i]);
};
auto del = [&](int i) -> void{
s.erase(s.find(i));
move_outside(p[i]);
};
auto check = [&](int k) -> bool{
nw.clear();
auto op=*mp.lower_bound(k);
for(auto i:op.second){
if(s.find(i)!=s.end()) continue;
if((int)s.size()>=cad*k) return 1;
add(i);
if(press_button()>k) del(i);
else nw.push_back(i);
}
mp[k]=s;
return (int)s.size()>=cad*k;
};
for(int i=0; i<n; i++){
add(i);
if(press_button()>1) del(i);
}
cad=(int)s.size();
mp[1]=s;
for(int i=0; i<n; i++) mp[n].insert(i);
int l=2,r=n/cad,ans=1;
while(l<=r){
int mid=(l+r)/2;
if(check(mid)){
ans=mid;
l=mid+1;
}else{
r=mid-1;
for(auto i:nw) del(i);
}
}
return ans;
}
/** /\_/\
* (= ._.)
* / >💖 \>💕
**/
Compilation message (stderr)
insects.cpp:69:9: warning: "/*" within comment [-Wcomment]
69 | /** /\_/\
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |