#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<vector<int>> adj(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) if (p[i][j]) {
adj[i].push_back(j);
adj[j].push_back(i);
}
}
vector<int> cc;
vector<bool> vis(n);
function<void(int)> dfs = [&](int u) {
vis[u] = true;
cc.push_back(u);
for (int to : adj[u]) if (!vis[to]) {
dfs(to);
}
};
vector<vector<int>> answer(n, vector<int>(n));
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i);
int m = cc.size();
int edges = 0;
for (int p : cc)
edges += adj[p].size();
if (edges >= m)
return 0;
}
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (p[i][j] == 1 && !answer[i][j])
answer[i][j] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (p[i][j] == 0 && answer[i][j])
return 0;
build(answer);
return 1;
}
