#include<iostream>
#include<vector>
#include"cave.h"
using namespace std;
int S[5001], D[5001];
int curS[5001];
void exploreCave(int N)
{
fill(S, S+5000, 0);
fill(D, D+5000, 0);
fill(curS, curS+5000, 0);
for(int i = 0; i < N; i++)
{
for(int j = 0; j < i; j++)
{
curS[j] = S[j];
}
for(int j = i; j < N; j++)
{
curS[j] = 0;
}
int open;
if(tryCombination(curS) > i) open = 0;
else open = 1;
int l = i, r = N-1;
while(l < r)
{
int m = (l+r+1)/2;
for(int j = i; j <= m; j++) curS[j] = open;
for(int j = m+1; j < N; j++) curS[j] = abs(open-1);
if(tryCombination(curS)) r = m;
else l = m+1;
}
S[i] = open;
D[i] = l;
}
answer(S, D);
}
