#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
struct DSU{
vector<int> p, rnk;
void init(int n){
p.assign(n, 0);rnk.assign(n, 0);
for(int i=0;i<n;i++)p[i] = i;
}
int par(int i){
if(p[i] == i)return i;
else return p[i] = par(p[i]);
}
bool issame(int i, int j){
return (par(i) == par(j));
}
void merge(int i, int j){
i=par(i), j=par(j);
if(i == j)return;
if(rnk[i] > rnk[j]){
rnk[i]++;
p[j] = i;
}else {
rnk[j]++;
p[i] = j;
}
}
};
int construct(vector<vector<int>> p) {
int n = p.size();
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(p[i][j] == 3)return 0;
}
}
DSU dsu; dsu.init(n);
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(p[i][j] == 0 && dsu.issame(i, j))return 0;
else if(p[i][j] > 0){
dsu.merge(i, j);
}
}
}
vector<bool> used(n);
vector<bool> ok(n, true);
vector<vector<int>> ans(n, vector<int>(n,0));
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(i != j && p[i][j] == 1)ok[i] = false;
}
}
DSU d; d.init(n);
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(p[i][j] == 1){
if(d.issame(i, j))continue;
ans[i][j] = 1;
ans[j][i] = 1;
d.merge(i, j);
}
}
int k=0;
for(;p[i][k]!=1;k++);
if(p[i] != p[k])return 0;
if(used[i])continue;
int ind = -1;
for(int j=i+1;j<n;j++){
if(p[i][j] == 2 && !used[j])ind = j;
}
if(ind == -1 || !ok[i])continue;
queue<int> q;q.push(i);used[i] = true;
vector<int> t;
while(!q.empty()){
int u = q.front();q.pop();
t.push_back(u);
for(int v=0;v<n;v++){
if(ok[v] && !used[v] && p[u][v] == 2){
used[v] = true;
q.push(v);
}
}
}
if(t.size() < 3)return 0;
t.push_back(t[0]);
for(int j=1;j<(int)t.size();j++){
ans[t[j]][t[j-1]] = 1;
ans[t[j-1]][t[j]] = 1;d.merge(t[j-1], t[j]);
}
}
build(ans);
return 1;
}
