제출 #988046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988046		badont	동굴 (IOI13_cave)	C++17	0 / 100	162 ms	580 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
  /* ... */
  int which_lock[N];
  int correct_choice[N];
  int buffer[N];

  for (int i = 0; i < N; i++)
    which_lock[i] = correct_choice[i] = buffer[i] = -1;

  for (int iter = 0; iter < N; iter++) {
    vector<int> todo;
    todo.reserve(N);
    for (int i = 0; i < N; i++) {
      if (which_lock[i] != -1) {
        buffer[i] = correct_choice[i];
      } else {
        buffer[i] = 0;
        todo.push_back(i);
      }
      assert(buffer[i] != -1);
    }
    int ret = tryCombination(buffer);
    int open_value = 1;
    if (ret == -1 or ret > iter) {
      // is open
      open_value = 0;
    }

    for (auto u : todo)
      buffer[u] = open_value;

    int lo = 0, hi = (int)todo.size() - 1;
    while (lo < hi) {
      int mid = (lo + hi) >> 1;

      for (int i = 0; i < mid; i++)
        buffer[todo[i]] = (open_value ^ 1);
      for (int i = mid; i < (int)todo.size(); i++)
        buffer[todo[i]] = open_value;

      int ret = tryCombination(buffer);
      if (ret == -1 or ret > iter)
        hi = mid;
      else
        lo = mid + 1;
    }
    which_lock[todo[lo]] = iter;
    correct_choice[todo[lo]] = open_value;
  }
  answer(which_lock, correct_choice);
}

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