Submission #1266163

#TimeUsernameProblemLanguageResultExecution timeMemory
1266163scalifrastico_098Rarest Insects (IOI22_insects)C++20
0 / 100
0 ms408 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int m, op=0;vector<int> f; bool f1(int n) { vector<int> hj(n, 0), ind; ind.reserve(n); for(auto x: ind) move_outside(x); ind.clear(); fill(hj.begin(), hj.end(), 0); for(int i=1; i<=m; i++) { int ad=0; for(int j=0; j<op; j++) { move_inside(f[j]);int u=press_button(); if(u>i){move_outside(f[j]);} else{hj[f[j]]=1; ad++; ind.push_back(i);} } if(ad<op){for(auto x: ind) move_outside(x); ind.clear(); fill(hj.begin(), hj.end(), 0); return false;} } return true; } int min_cardinality(int n) { f.resize(n); for(int i=0; i<n; i++){move_inside(i); if(press_button()>1) move_outside(i); else f.push_back(i); op++;} for(auto x:f)move_outside(x); if(op<=1) return n; if(op==n) return 1; int l=0, 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...