#include "bits/stdc++.h" // #include "grader.c" #include "cave.h" #define MAXN 500005 int a[MAXN], n, b[MAXN], st[MAXN]; void exploreCave(int N) { n = N; for(int i = 0; i < n; i++) { b[i] = i; a[i] = 0; } for(int i = 0; i < n; i++) { int jog = 0; for(int j = 0; j < n; j++) { if(st[j]) continue; int x1 = tryCombination(a); a[j] = 1 - a[j]; int x2 = tryCombination(a); if(x1 == i && x2 != i || x2 == i && x1 != i) { if(x1 == i) a[j] = 1 - a[j]; jog = j; break; } } st[jog] = 1; b[jog] = i; } answer(a, b); }