제출 #380658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
380658		WLZ	동굴 (IOI13_cave)	C++14	100 / 100	314 ms	876 KiB

cave

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

void exploreCave(int N) {
  int S[N], D[N];
  vector<int> left(N);
  iota(left.begin(), left.end(), 0);
  for (int i = 0; i < N; i++) {
    for (auto& x : left) S[x] = 1;
    int b = tryCombination(S) == i;
    for (auto& x : left) S[x] = !b;
    int lo = 0, hi = (int) left.size() - 1;
    while (lo < hi) {
      int mid = lo + (hi - lo) / 2;
      for (int j = lo; j <= mid; j++) S[left[j]] = b;
      if (tryCombination(S) == i) hi = mid;
      else lo = mid + 1;
      for (int j = lo; j <= mid; j++) S[left[j]] = !b;
    }
    S[left[lo]] = !b;
    D[left[lo]] = i;
    left.erase(left.begin() + lo);
  }
  answer(S, D);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24