Submission #1042459

#TimeUsernameProblemLanguageResultExecution timeMemory
1042459Alihan_8Rarest Insects (IOI22_insects)C++17
25 / 100
223 ms684 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define ar array #define all(x) x.begin(), x.end() template <class F, class S> bool chmin(F &u, const S &v){ bool flag = false; if ( u > v ){ u = v; flag |= true; } return flag; } const int C = 100; int min_cardinality(int n) { vector <int> p; for ( int i = 0; i < n; i++ ){ move_inside(i); if ( press_button() == 1 ){ p.pb(i); } else{ move_outside(i); } } if ( (int)p.size() >= C ){ int cnt = 0; vector <int> us(n); while ( !*min_element(all(us)) ){ cnt += 1; int lst = (int)p.size(); for ( auto &j: p ){ us[j] = 1; move_outside(j); } p.clear(); for ( int i = 0; i < n; i++ ){ if ( us[i] ) continue; move_inside(i); if ( press_button() == 1 ){ p.pb(i); } else{ move_outside(i); } } if ( (int)p.size() != lst ){ break; } } return cnt; } else{ vector <int> us(n); for ( auto &j: p ){ move_outside(j); } p.clear(); vector <int> f; while ( !*min_element(all(us)) ){ int cnt = 0; for ( int i = 0; i < n; i++ ){ if ( us[i] ) continue; move_inside(i); if ( press_button() == cnt + 1 ){ cnt += 1; p.pb(i); } else{ move_outside(i); } } f.pb(cnt); for ( auto &x: p ){ us[x] = 1; move_outside(x); } p.clear(); } return *min_element(all(f)); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...