#include "supertrees.h"
#include <vector>
using namespace std;
struct DSU{
vector<int>par,sz;
void init(int n){
par.resize(n+1);sz.resize(n+1);
for(int i=0;i<n;i++)par[i]=i,sz[i]=1;
}
int root(int u){
return par[u]==u ? u:par[u]=root(par[u]);
}
bool merge(int u,int v){
int ru=root(u),rv=root(v);
if(ru==rv)return 0;
if(sz[ru]>sz[rv])swap(sz[ru],sz[rv]);
par[ru]=rv;sz[rv]+=sz[ru];
return 1;
}
};
int construct(std::vector<std::vector<int>> p) {
int n=p[0].size();
vector<vector<int>>v(n,vector<int>(n,0));
DSU d1,d2;d1.init(n);d2.init(n);
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(p[i][j]==1)d1.merge(i,j);
if(p[i][j]==2)d2.merge(i,j);
if(p[i][j]==3)return 0;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(p[i][j]==0&&d1.root(i)==d1.root(j))return 0;
}
}
vector<vector<int>>comp1(n),comp2(n);
for(int i=0;i<n;i++){
comp1[d1.root(i)].push_back(i);
comp2[d2.root(i)].push_back(i);
}
for(int i=0;i<n;i++){
if(comp1[i].size()){
for(int j=1;j<comp1[i].size();j++){
int u=comp1[i][j-1],w=comp1[i][j];
v[u][w]=v[w][u]=1;
}
}
if(comp2[i].size()){
if(comp2[i].size()<3)return 0;
int m=comp2[i].size();
for(int j=0;j<m;j++){
int u=comp2[i][j],w=comp2[i][(j+1)%m];
v[u][w]=v[w][u]=1;
}
}
}
build(v);
return 1;
}
