Submission #859232

#TimeUsernameProblemLanguageResultExecution timeMemory
859232MasterDobbyRarest Insects (IOI22_insects)C++17
0 / 100
200 ms344 KiB
#include <bits/stdc++.h> #include "insects.h" #define all(a) a.begin(),a.end() #define pii pair<int,int> using namespace std; using ll = long long; bitset<2020> ch; int min_cardinality(int n){ int cnt=1; ch[0]=1; move_inside(0); for(int i=1;i<n;i++){ move_inside(i); int num=press_button(); if(num==1){ ch[i]=1; cnt++; } else{ move_outside(i); } } int ans=1; // for(int i=2;i<=n;i++){ // int cnt2=0; // for(int j=0;j<n;j++){ // if(cnt2==cnt) break; // if(ch[j]) continue; // move_inside(j); // int num=press_button(); // if(num==i){ // ch[j]=1; // cnt2++; // } // else{ // move_outside(j); // } // } // if(cnt2!=cnt) break; // ans=i; // } int l=2,r=n; while(l<r){ int mid=(l+r)/2; int cnt2=cnt; vector<int> nw; for(int j=0;j<n;j++){ if(cnt2==mid*cnt) break; if(ch[j]) continue; nw.push_back(j); move_inside(j); int num=press_button(); if(num<=mid){ // ch[j]=1; cnt2++; } else{ move_outside(j); } } for(auto x:nw) move_outside(x); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...