#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
void markall(int i ,int j ,vector<int>&f,vector<int>&b,vector<vector<int>>&p,vector<vector<int>>&answer){
int k = b[i];
while(k!=-1){
int u = j;
while(u!=-1){
if (!answer[k][u]){
p[k][u]--;
p[u][k]--;
answer[k][u]++;
answer[u][k]++;}
u=f[u];}
k=b[k];
}
}
bool check(vector<int>f,vector<int>b,int i ,int j,vector<vector<int>>p){
int k = b[i];
while(k!=-1){
int u = j;
while(u!=-1){
if (p[k][u]<=0)return false;
u=f[u];}
k=b[k];
}
return true;
}
int construct(vector<std::vector<int>> p) {
int n = p.size();
vector<vector<int>>answer(n,vector<int>(n,0));
vector<vector<int>>vanswer(n,vector<int>(n,0));
/*
1 1 0 0 - 0 - 1
1 1 1 0 0 - 1 - 2
1 0 1 1 2 - 3
1 0 1 0
//0 - 1 - 2 - 3 - 4
*/
for (int i =0;i<n;++i){
for (int j =0;j<n;++j){
if (j==i+1||j==i-1)answer[i][j]=1;
}
}
build(answer);
return 1;
}
