Submission #812828

#TimeUsernameProblemLanguageResultExecution timeMemory
812828blackyuki드문 곤충 (IOI22_insects)C++17
100 / 100
44 ms272 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> P; typedef vector<ll> vi; typedef vector<vi> vvi; typedef vector<P> vp; typedef vector<vp> vvp; typedef vector<bool> vb; #define rep(i,n) for(ll i=0;i<(ll)(n);i++) #define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++) #define all(a) a.begin(),a.end() #define fi first #define se second #define pb emplace_back #define lb(v,k) (lower_bound(all(v),k)-v.begin()) template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;} template<class T> void out(T a){cout<<a<<'\n';} template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';} const ll inf=1001001001001001001; #include "insects.h" int min_cardinality(int N) { vb dead(N,false),flag(N,false); ll cnt=0; auto add=[&](ll i){ move_inside(i); cnt++; flag[i]=true; return press_button(); }; auto del=[&](ll i){ move_outside(i); cnt--; flag[i]=false; }; rep(i,N){ if(add(i)>1)del(i); } ll s=cnt,f=1; ll n=N-cnt; dead=flag; while(n>=s){ ll md=(n+s*2-1)/(s*2); rep(i,N)if(!dead[i]&&flag[i]&&cnt>s*f+md)del(i); rep(i,N)if(!dead[i]&&!flag[i]){ if(add(i)>f+md)del(i); } if(cnt==(f+md)*s){ f+=md; rep(i,N)if(!dead[i]&&flag[i]){ n--;dead[i]=true; } } else{ rep(i,N)if(!dead[i]&&!flag[i]){ n--;dead[i]=true; } } } return f; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...