제출 #745062

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

insects

#include "insects.h"
 
#include <bits/stdc++.h>
using namespace std;
 
int types = 0, ch[2020], use[2020], cnt = 0;
 
int min_cardinality(int N) {
 
  // calculate types: N times
  for (int i = 0; i < N; i++) {
    move_inside(i);
    if (press_button() >= 2) move_outside(i);
    else {
      ch[i] = 1;
      types++;
      cnt++;
      use[i] = 1;
    }
  }
 
  int st = 1, ed = N / types;
  while (st < ed) {
    int x = (st + ed + 1) / 2;
    for (int i = 0; i < N; i++) {
      if (ch[i] == 1) continue;
      move_inside(i);
      if (press_button() > x) move_outside(i);
      else {
        use[i] = 1;
        cnt++;
      }
    }
    if (cnt == x * types) {
      st = x;
      for (int i = 0; i < N; i++) if (use[i] == 1) ch[i] = 1;
    }
    else {
      ed = x - 1;
      for (int i = 0; i < N; i++) if (use[i] == 0) ch[i] = 1;
      for (int i = 0; i < N; i++) {
        if (ch[i] == 1) continue;
        move_outside(i);
        if (press_button() < (st + ed + 1) / 2) move_inside(i);
        else {
          use[i] = 0;
          cnt--;
        }
      }
    }
  }
 
  return st;
}

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