#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
const int maxn = 1000 + 5;
vector<int> par(maxn), cc[maxn];
int R(int x) {return par[x] ^ x ? par[x] = R(par[x]) : x;}
void U(int x, int y) {par[R(x)] = R(y);}
int construct(vector<vector<int>> p) {
iota(ALL(par), 0);
int n = p.size();
vector<vector<int>> ans(n, vector<int>(n, 0));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (p[i][j] == 3) return 0;
if (p[i][j]) U(i, j);
}
}
for (int i = 0; i < n; ++i) {
cc[R(i)].eb(i);
for (int j = 0; j < n; ++j) {
if (!p[i][j] and R(i) == R(j)) return 0;
}
}
for (int i = 0; i < n; ++i) {
int sz = cc[i].size();
for (int j = 0; j < sz-1; ++j) {
ans[cc[i][j]][cc[i][j+1]] = 1;
ans[cc[i][j+1]][cc[i][j]] = 1;
}
}
build(ans);
return 1;
}
