#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
const int MAX_N = 1e3 + 5;
int n;
vector <vector <int>> answer;
vector <int> graph[MAX_N];
bool visited[MAX_N];
bool ok;
void dfs(int u) {
visited[u] = true;
for(auto v : graph[u]) {
if(visited[v] == false) {
if(ok == true) {
answer[u][v] = answer[v][u] = 1;
}
dfs(v);
}
}
}
int construct(vector <vector <int>> p) {
n = p.size();
fill(visited, visited + n, false);
answer.resize(n, vector <int> (n, 0));
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
if(p[i][j] == 1) {
graph[i].push_back(j);
graph[j].push_back(i);
}
}
}
ok = true;
for(int i = 0; i < n; i++) {
if(visited[i] == false) {
dfs(i);
}
}
ok = false;
for(int i = 0; i < n; i++) {
fill(visited, visited + n, false);
dfs(i);
for(int j = 0; j < n; j++) {
if(visited[j] == true and p[i][j] == 0) {
return 0;
}
}
}
build(answer);
return 1;
}
