Submission #1266556

#TimeUsernameProblemLanguageResultExecution timeMemory
1266556scalifrastico_098Rarest Insects (IOI22_insects)C++20
0 / 100
97 ms408 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int m, op=0, c=0, pk=0; vector<bool> fg; bool f1(int n) { vector<int> ind; int i=pk, lk=0; while(i<n&&c<op*m) { if(!fg[i]){ move_inside(i); if(press_button()<=m){fg[i]=true; c++; ind.push_back(i);} else move_outside(i);} i++; if(i==n) i=0; lk++; } pk=i; if(c==op*m) return true; for(auto x:ind){move_outside(x); fg[x]=false; c--;} return false; } int min_cardinality(int n) { op=0; c=0; pk=0; fg.assign(n, false); for(int i=0; i<n; i++){move_inside(i); if(press_button()>1) move_outside(i); else {fg[i]=true; c++; op++;}} if(op<=1) return n; if(op==n) return 1; int l=1, r=n/op; while(l<r) { m=(l+r+1)/2;if(f1(n)){l=m;} else r=m-1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...