#include <bits/stdc++.h>
#include "supertrees.h"
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
struct DSU {
int n, comp;
vector<int> par, size;
void config(int _n) {
n = _n + 1;
comp = _n;
par.resize(n+1);
size.resize(n+1, 1);
for(int i=1; i<=n; i++) par[i] = i;
}
int get(int u) {
if(u == par[u]) return u;
return par[u] = get(par[u]);
}
bool uni(int u, int v) {
u = get(u), v = get(v);
if(u == v) return false;
if(size[u] < size[v]) swap(u, v);
size[u] += size[v];
par[v] = u;
comp--;
return true;
}
int getComp() { return comp; }
int getSize(int u) { return size[get(u)]; }
bool sameSet(int u, int v) { return get(u) == get(v); }
};
int construct(vector<vector<int> > p) {
int n = p.size();
DSU dsu; dsu.config(n);
vector<vector<int> > B(n, vector<int>(n, 0));
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] == 1)
if(dsu.uni(i, j)) B[i][j] = B[j][i] = 1;
}
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if(p[i][j] == 1 && !dsu.sameSet(i, j)) return 0;
if(p[i][j] == 0 && dsu.sameSet(i, j)) return 0;
}
}
build(B);
return 1;
}
