Submission #97986

#	Time	Username	Problem	Language	Result	Execution time	Memory
97986		AlexLuchianov	Cave (IOI13_cave)	C++14	100 / 100	1045 ms	504 KiB

cave

#include <iostream>
#include "cave.h"

using namespace std;

/*
void answer(int S[], int D[], int n){
  for(int i = 0 ; i < n; i++)
    cout << S[i] << " ";
  cout << '\n';

  for(int i = 0 ; i < n; i++)
    cout << D[i] << " ";
}


int tryCombination(int S[], int n) {
  for(int i = 0; i < n; i++)
    cout << S[i] << " ";
  cout << '\n';
  int ans;
  cin >> ans;
  return ans;
}
//*/

void exploreCave(int n) {
  int door[n] = {0}, per[n] = {0}, seen[n] = {0};

  for(int i = 0; i < n; i++){
    int from = 0, to = n - 1;
    int val = tryCombination(door);
    if(i < val || val == -1)
      for(int j = 0; j < n; j++)
        if(seen[j] == 0)
          door[j] ^= 1;

    while(from < to){
      int mid = (from + to) / 2;
      for(int j = 0; j <= mid; j++)
        if(seen[j] == 0)
          door[j] ^= 1;
      int val = tryCombination(door);
      if(i < val || val == -1){
        to = mid;
      } else
        from = mid + 1;
      for(int j = 0; j <= mid; j++)
        if(seen[j] == 0)
          door[j] ^= 1;

    }
    door[from] ^= 1;
    per[from] = i;
    seen[from] = 1;
  }
  answer(door, per);
}

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