#include <iostream>
#include "supertrees.h"
using namespace std;
int rt[1<<10];
int construct(vector<vector<int>> p){
int n = p.size();
vector<vector<int>> adj(n, vector<int> (n, 0));
for (int i=0;i<n;i++)
rt[i] = -1;
for (int i=0;i<n;i++){
if (rt[i] == -1){
rt[i] = i;
for (int j=0;j<n;j++)
if (i != j and p[i][j] == 1)
rt[j] = i, adj[i][j] = adj[j][i] = 1;
}
}
for (int i=0;i<n;i++){
int t = 1;
for (int j=i+1;t and j<n;j++){
if (i == rt[i] and j == rt[j] and p[i][j] == 2)
adj[i][j] = adj[j][i] = 1, t = 0;
}
for (int j=0;t and j < i;j++){
if (i == rt[i] and j == rt[j] and p[i][j] == 2)
adj[i][j] = adj[j][i] = 1, t = 0;
}
}
build(adj);
return 1;
}
