Submission #1042686

#TimeUsernameProblemLanguageResultExecution timeMemory
1042686NurislamRarest Insects (IOI22_insects)C++17
0 / 100
7 ms344 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define ff first #define ss second #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() template <class F, class _S> bool chmin(F &u, const _S &v){ bool flag = false; if ( u > v ){ u = v; flag |= true; } return flag; } template <class F, class _S> bool chmax(F &u, const _S &v){ bool flag = false; if ( u < v ){ u = v; flag |= true; } return flag; } int min_cardinality(int n) { vector<int> v; int k = 0; for(int i = 0; i < n; i++){ move_inside(i); if(press_button() == 1){ k++; }else { move_outside(i); v.pb(i); } } //~ for(auto i:v)cout << i << ' '; //~ cout << '\n'; int l = 1, r = 2000, ans = 1; int cnt = k; while(l <= r){ int m = (l+r)>>1; vector<int> up, dn; for(int i:v){ move_inside(i); if(press_button() <= m){ dn.pb(i); }else{ up.pb(i); move_outside(i); } } if(k*m == (int)dn.size() + cnt){ ans = m; l = m+1; v = up; cnt += dn.size(); }else{ r = m-1; v = dn; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...