Submission #1124218

#TimeUsernameProblemLanguageResultExecution timeMemory
1124218epicci23Rarest Insects (IOI22_insects)C++17
0 / 100
2074 ms412 KiB
#include "insects.h" #include "bits/stdc++.h" using namespace std; const int N = 2e3 + 5; int vis[N], D , tot = 0 , Kill[N]; inline bool Add(int x){ if(vis[x] || Kill[x]) return 0; vis[x]=1; tot++; move_inside(x); return 1; } inline bool Rem(int x){ if(!vis[x] || Kill[x]) return 0; vis[x]=0; tot--; move_outside(x); return 1; } inline int Get(){ return press_button(); } int min_cardinality(int n){ for(int i=0;i<n;i++){ Add(i); if(i == 0 || Get() == 1) continue; Rem(i); } D = tot; if(D > n / 2) return 1; if(D == 1) return n; int l = 1 , r = n / D; while(l <= r){ int B = (l + r + 1) / 2; vector<int> to_kill; for(int i = 0 ; i < n ; i++){ if(vis[i] || Kill[i]) continue; Add(i); if(tot > B && Get() > B){ Rem(i); to_kill.push_back(i); } } if(tot == B * D) l = B; else{ for(int x : to_kill) Kill[x] = 1; r = tot / D; } } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...