제출 #1281157

#제출 시각아이디문제언어결과실행 시간메모리
1281157Faggi드문 곤충 (IOI22_insects)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> #define ll long long #define sz(x) int(x.size()) #define forn(i,n) for(i=0; i<n; i++) #define all(x) x.begin(),x.end() #define pb push_back #define mp make_pair #define fr first #define se second using namespace std; void move_inside(int i); void move_outside(int i); int press_button(); int min_cardinality(int N) { ll i, act=0, n=N; vector<ll>in,out,ins; for(i=0; i<n; i++) ins.pb(i); for(auto k:ins) { move_inside(k); if(press_button()>1) { move_outside(k); out.pb(k); } else { in.pb(k); act++; } } ll l=2, r=n/act, piv, pos=1, tot=act; ins=in; while(l<=r) { piv=(l+r)/2; in.resize(0); out.resize(0); for(auto k:ins) { move_inside(k); if(press_button()>piv) { move_outside(k); out.pb(k); } else { in.pb(k); act++; } } if(act==tot*piv) { l=piv+1; pos=piv; ins=out; } else { r=piv-1; for(auto k:in) { move_outside(k); act--; } ins=in; } } return int(pos); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...