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