Submission #1329290

#TimeUsernameProblemLanguageResultExecution timeMemory
1329290apxo드문 곤충 (IOI22_insects)C++20
47.50 / 100
61 ms448 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];
}

int min_cardinality(int N) {
  n = N;
  int res = 0;
  int ds = 0;
  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 = 1, r = n / ds;
  while (l <= r) {
    int mid = (l + r) >> 1;
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
      move_inside(i);
      if (press_button() > mid) {
        move_outside(i);
      } else {
        ++cnt;
        xx.push_back(i);
      }
    }
    while (!xx.empty()) {
      move_outside(xx.back());
      xx.pop_back();
    }
    if (cnt == 1ll * mid * ds) {
      res = mid;
      l = mid + 1;
    } else r = mid - 1;
  }
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...