#include "supertrees.h" #include<bits/stdc++.h> using namespace std; int construct(vector<vector<int>>p){ int n = p.size(); for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if(p[i][j] != 1){ return 0; } } fill(p[i].begin(), p[i].end(), 0); } for(int i = 1; i < n; i++){ p[i][i - 1] = p[i - 1][i] = 1; } build(p); return 1; }