#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include "cave.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=5e3+50;
const int mod=1e9+7;
using namespace std;
int n,l,r,mid,fn[nmax],val[nmax],rs;
int ok(int x,int j,int b)
{
int y,vl[n];
for(int i=0;i<=x;i++)vl[i]=b;
for(int i=x+1;i<n;i++)vl[i]=b^1;
for(int i=0;i<j;i++)vl[fn[i]]=val[i];
y=tryCombination(vl);
if(y==j)return 1;
return 0;
}
void exploreCave(int N)
{
n=N;
int s[n],d[n];
for(int i=0;i<n;i++)
{
int b=ok(n-1,i,0);
l=0,r=n-1,rs=0;
while(l<=r)
{
mid=(l+r)/2;
if(!ok(mid,i,b^1))l=mid+1,rs=l;
else r=mid-1;
}
s[rs]=b;
d[rs]=i;
fn[i]=rs;
val[i]=b;
}
answer(s,d);
}
/*int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n;
int s[n],d[n];
for(i=0;i<n;i++)
{
int b=ok(n-1,i,0);
l=0,r=n-1,rs=0;
while(l<=r)
{
mid=(l+r)/2;
if(!ok(mid,i,b^1))l=mid+1,rs=l;
else r=mid-1;
}
s[rs]=b;
d[rs]=i;
fn[i]=rs;
val[i]=b;
}
answer(s,d);
return 0;
}*/
