# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720109 | mseebacher | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
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] = 1;
ans[i+1][i] = 1;
}
build(ans);
return 1;
}