#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> pa;
int f(int x){
if (pa[x]==x) return x;
return pa[x] = f(pa[x]);
}
void u(int x, int y){
if (f(x)==f(y)) return;
pa[f(x)] = f(y);
}
int construct(std::vector<std::vector<int> > p) {
int n = p.size();
for (int i = 0;i<n;i++) pa.push_back(i);
vector<vector<int> > ans;
ans.resize(n);
for (int i = 0;i<n;i++) ans[i].assign(n,0);
for (int i = 0;i<n;i++){
for (int j = 0;j<n;j++){
if (p[i][j]==1 and f(i)!=f(j)) {u(f(i),f(j));ans[i][j] = 1;ans[j][i]=1;}
}
}
for (int i = 0;i<n;i++){
for (int j = 0;j<n;j++){
if (p[i][j]==0 and f(i)==f(j)) return 0;
}
}
build(ans);
return 1;
}
