#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int N;
vector<vector<int>>adj;
int pa[1005];
int fp(int a){return pa[a]==a?a:pa[a]=fp(pa[a]);}
void un(int a,int b){pa[fp(b)]=fp(a);}
int have1[1005];
int have2[1005];
int have3[1005];
int vis1[1005];
int vis2[1005];
int vis3[1005];
int cant=0;
vector<vector<int>> answer;
void build1(int u){
vector<int>node;
node.push_back(u);
vis1[u]=1;
for(int i=0;i<N;i++)if(i!=u&&adj[u][i]==1){
if(vis1[i])cant=1;
vis1[i]=1;
node.push_back(i);
}
for(int i=0;i<node.size()-1;i++){
int x=node[i],y=node[i+1];
answer[x][y]=1,answer[y][x]=1;
}
}
int construct(std::vector<std::vector<int>> p) {
N = p.size();
for (int i = 0; i < N; i++) {
vector<int> row;
row.resize(N);
answer.push_back(row);
}
adj=p;
for(int i=0;i<N;i++)pa[i]=i;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
int x=p[i][j];
if(x==1)have1[i]=1;
else if(x==2)have2[i]=1;
else if(x==3)have3[i]=1;
if(x)un(i,j);
}
}
for(int i=0;i<N;i++)for(int j=0;j<N;j++){
int x=(adj[i][j]!=0);
int y=(fp(i)==fp(j));
if(x!=y)cant=1;
}
for(int i=0;i<N;i++)for(int j=0;j<N;j++)if(adj[i][j]!=adj[j][i])cant=1;
for(int i=0;i<N;i++){
if(have1[i]&&vis1[i]==0)build1(i);
}
if(cant)return 0;
build(answer);
return 1;
}
