Submission #859196

#	Time	Username	Problem	Language	Result	Execution time	Memory
859196		NatdanaiHS	Rarest Insects (IOI22_insects)	C++17	53.16 / 100	95 ms	848 KiB

insects

#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;
// bool updatemin(int need,int N){
//   int cnt=0;
//   for(int i=0;i<N;i++){
//     if(cnt==snow)return true;
//     if(flag[i])continue;
//     cnt++;
//     move_inside(i);
//     flag[i]=true;
//     if(press_button()==need)continue;
//     else{
//       move_outside(i);
//       flag[i]=false,cnt--;
//     }
//   }
//   return cnt==snow;
// }
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> rollback;
    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);
        else{
            cnt++;
            rollback.push(i);
        }
    }
    if(cnt==(mid-ans)*snow){
        ans=mid;
        l=mid+1;
        while(rollback.size()){
            flag[rollback.top()]=true;
            rollback.pop();
        }
    }
    else{
        r=mid-1;
        while(rollback.size()){
            move_outside(rollback.top());
            rollback.pop();
        }
    }
  }
 
 

  return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 28.16 / 75