제출 #1329324

#제출 시각아이디문제언어결과실행 시간메모리
1329324apxoRarest Insects (IOI22_insects)C++20
99.97 / 100
15 ms456 KiB
#include "bits/stdc++.h"
#include "insects.h"
using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else 
#define debug(...)
#endif

namespace {
  const int maxn = 2005;
  int n;
  bool vis[maxn];
  bool ban[maxn];
  int lst;
}

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
  assert(l <= r);
  return uniform_int_distribution<int> (l, r)(rng);
}

int min_cardinality(int N) {
  n = N;
  int ds = 0;
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  shuffle(p.begin(), p.end(), rng);
  vector<int> xx;
  for (int i = 0; i < n; ++i) {
    move_inside(i);
    if (press_button() > 1) move_outside(i);
    else {
      ++ds;
      xx.push_back(i);
    }
  }
  while (!xx.empty()) {
    move_outside(xx.back());
    xx.pop_back();
  }
  debug(ds);
  int l = 2, r = n / ds;
  int res = 1;
  int cnt = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    int hehe = 0;
    for (int i = 0; i < n; ++i) {
      hehe += (!ban[i]);
    }
    if (hehe < 1ll * mid * ds) {
      r = mid - 1;
      continue;
    }
    vector<int> niu, bb;
    int skip = 0;
    for (int oi = 0; oi < n; ++oi) {
      int i = p[oi];
      if (vis[i] || ban[i]) continue;  
      move_inside(i);
      if (skip) {
        niu.push_back(i);
        vis[i] = 1;
        ++cnt;
        --skip;
      } else {
        int xx = press_button();
        if (xx <= mid) {
          skip = mid - xx;
          niu.push_back(i);
          ++cnt;
          vis[i] = 1;
        } else {
          move_outside(i);
          bb.push_back(i);
        } 
      }
      if (cnt == 1ll * mid * ds) break;
    }
    if (cnt == 1ll * mid * ds) {
      res = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
      for (auto i : niu) {
        vis[i] = 0;
        move_outside(i);
        --cnt;
      }
      for (auto i : bb) {
        ban[i] = 1;
      }
    }
  }
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...