#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
vector<int> grp(n);
for (int i = 0; i < n; i++) {
grp[i] = i;
}
auto fnd = [&] (auto &&self, int a) {
if (grp[a] == a) {
return a;
} else {
return grp[a] = self(self, grp[a]);
}
};
vector<vector<int>> edge(n, vector(n, 0));
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (p[i][j] == 2) {
int x = fnd(fnd, i), y = fnd(fnd, j);
grp[x] = y;
}
}
}
vector<bool> vis(n);
for (int i = 0; i < n; i++) {
if (!vis[i]) {
vector<int> cyc = {i};
vis[i] = true;
for (int j = i + 1; j < n; j++) {
int x = fnd(fnd, i), y = fnd(fnd, j);
if (x == y) {
cyc.push_back(j);
vis[j] = true;
}
}
if (cyc.size() == 1) {
continue;
}
if (cyc.size() == 2) {
return 0;
}
for (int u : cyc) {
for (int v : cyc) {
if (u != v && p[u][v] != 2) {
return 0;
}
}
}
for (int i = 1; i < (int)cyc.size(); i++) {
edge[cyc[i]][cyc[i - 1]] = edge[cyc[i - 1]][cyc[i]] = 1;
}
edge[cyc[0]][cyc.back()] = edge[cyc.back()][cyc[0]] = 1;
}
}
build(edge);
return 1;
}
