#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
void dfs(int n, const vector<vector<int>> &p, int node, int c, vector<int> &comp) {
comp[node] = c;
for (int i = 0; i < n; i++) {
if (p[node][i] == 1 && comp[i] == -1) {
dfs(n, p, i, c, comp);
}
}
}
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> b(n, vector<int>(n, 0));
vector<int> comp(n, -1);
int c = 0;
for (int i = 0; i < n; i++) {
if (comp[i] == -1) {
dfs(n, p, i, c, comp);
c++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (p[i][j] == 1 && comp[i] != comp[j]) return 0;
if (p[i][j] == 0 && comp[i] == comp[j]) return 0;
}
}
for (int j = 0; j < c; j++) {
vector<int> g;
for (int i = 0; i < n; i++) {
if (comp[i] == j) g.push_back(i);
}
for (int i = 0; i + 1 < g.size(); i++) {
int u = g[i], v = g[i + 1];
b[u][v] = b[v][u] = 1;
}
}
build(b);
return 1;
}
