Submission #859341

#TimeUsernameProblemLanguageResultExecution timeMemory
859341NatdanaiHSRarest Insects (IOI22_insects)C++17
96.54 / 100
35 ms1172 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; //move_inside //move_outside //press_button vector<bool> flag(2020,false); int ans=1,snow=1; int min_cardinality(int N) { flag[0]=true; move_inside(0); //Prime Set for(int i=1;i<N;i++){ move_inside(i); if(press_button()!=1)move_outside(i); else snow++,flag[i]=true; } //find ans int l=1,r=N/snow; while(l<=r){ int mid=(l+r)/2; stack<int> roll; int cnt=0; for(int i=0;i<N;i++){ if(cnt==(mid-ans)*snow)break; if(flag[i])continue; move_inside(i); // if(press_button()>mid)move_outside(i),flag[i]=true,roll.push(i); else{ cnt++; roll.push(i); } } if(cnt==(mid-ans)*snow){ ans=mid; l=mid+1; while(roll.size()){ flag[roll.top()]=!flag[roll.top()]; roll.pop(); } } else{ r=mid-1; while(roll.size()){ move_outside(roll.top()); roll.pop(); } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...