#include "supertrees.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int>(n, 0)); for (int i=0; i<n-1; i++) { ans[i][i+1] = ans[i+1][i] = 1; } build(ans); return 1; }