Submission #787154

#TimeUsernameProblemLanguageResultExecution timeMemory
787154alexander707070Rarest Insects (IOI22_insects)C++17
0 / 100
175 ms300 KiB
#include<bits/stdc++.h> #include "insects.h" #define MAXN 2007 using namespace std; int n,last,cnt,ans,pt; vector<int> diff,s; int l[MAXN],r[MAXN],br[MAXN]; bool used[MAXN],in[MAXN]; vector< pair<int,int> > qr; bool ok(int k){ cnt=0; for(int i=0;i<n;i++){ move_inside(i); cnt++; if(press_button()>k){ move_outside(i); cnt--; } } if(cnt==k*int(diff.size()))return true; return false; } int min_cardinality(int N){ n=N; for(int i=0;i<n;i++){ move_inside(i); diff.push_back(i); if(press_button()>1){ move_outside(i); diff.pop_back(); } } for(int i:diff)move_outside(i); int l=1,r=N/int(diff.size())+1,tt; while(l+1<r){ tt=(l+r)/2; if(ok(tt)){ l=tt; }else{ r=tt; } } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...