#include "cave.h"
#include<bits/stdc++.h>
const int maxn = 5051;
int n;
int S[maxn], D[maxn];
void blocB() {
for (int i = 0; i < n; i++) {
S[i] = 1;
D[i] = tryCombination(S);
S[i] = 0;
}
answer(S, D);
}
void exploreCave(int N) {
n = N;
memset(S, 0, sizeof S);
if (tryCombination(S) == -1)
blocB();
memset(D, -1, sizeof D);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (D[j] != -1)
continue;
int a = tryCombination(S);
S[j] ^= 1;
int b = tryCombination(S);
if (a == b)
continue;
if (a == i) {
D[j] = i;
break;
}
if (b == i) {
D[j] = i;
S[j] ^= 1;
break;
}
}
}
answer(S, D);
}
