#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int> g[1005],s;
bool vs[1005],y;
void dfs(int u)
{
s.pb(u);
vs[u] = true;
for (int v : g[u]) if (!vs[v]) dfs(v);
}
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
y= true;
for (int i=0;i<n;i++) for (int j=0;j<n;j++) if (i!=j) if (p[i][j]==1) g[i].pb(j);
for (int i=0;i<n;i++) if (!vs[i]) {
s.clear();
dfs(i);
int ss = s.size();
for (int j=0;j<ss-1;j++) {
answer[s[j]][s[j+1]] = 1;
answer[s[j+1]][s[j]] = 1;
}
for (int u : s) {
for (int v : s) {
if (p[u][v]==0) y = false;
}
}
}
if (y) build(answer);
if (y) return 1;
else return 0;
}
