# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432080 | 2021-06-17T20:18:13 Z | peuch | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int> > p) { int n = pointer.size(); vector<vector<int> > ans (n, vector<int> (n)); for(int i = 1; i < n; i++){ ans[i][i - 1] = 1; ans[i - 1][i] = 1; } build(answer); return 1; }