제출 #640873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640873		TimDee	드문 곤충 (IOI22_insects)	C++17	0 / 100	91 ms	288 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int n;
int min_cardinality(int N) {
  n=N;
  int d=0;
  vector<int> in(n,0);
  for(int i=0; i<n; ++i) {
    move_inside(i);
    int x=press_button();
    if (x>1) move_outside(i);
    else { in[i]=1; ++d; }
  }

  //cout<<d<<'\n';
  //for (int i=0; i<n; ++i) cout<<in[i]<<' '; cout<<'\n';
  if (d==1) return n;
  if (d<=8) {
    for (int i=0; i<n; ++i) {
      if (in[i]) {
        in[i]=0;
        move_outside(i);
      }
    }
    int ans=n;
    vector<int> vis(n,0);
    for (int i=0; i<d; ++i) {
      vector<int> bulaneala;
      int cnt=0;
      for (int i=0; i<n; ++i) {
        if (vis[i]) continue;
        move_inside(i);
        int x=press_button();
        if (x==cnt) move_outside(i);
        else {
          bulaneala.push_back(i);
          ++cnt;
          vis[i]=1;
        }
      }
      ans=min(ans,cnt);
      for (auto x:bulaneala) move_outside(x);
    }
    return ans;
  }

  int l=1, r=n/d;
  while (l<r) {
    int mid=(l+r+1)>>1;
    int extra=0;
    int cnt=0;
    for (int i=0; i<n; ++i) {
      if (in[i]) continue;
      move_inside(i);
      int x=press_button();
      if (x>mid) {
        extra=1;
        move_outside(i);
      } else ++cnt;
      in[i]=1;
    }
    if (cnt==mid*d) {
      if (extra==0) {
        return mid;
      } else {
        l=mid;
      }
    } else {
      r=mid-1;
      for (int i=0; i<n; ++i) { if (in[i]) move_outside(i); in[i]=0; }
    }
  }
  return r;

}

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