# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424488 | berrygarlic | Connecting Supertrees (IOI20_supertrees) | C++14 | 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 <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int> > p){
int n = p.size();
vector<vector<int> > b(n,vector<int>(n));
for(int i=1;i<n;i++){
b[i-1][i] = 1;
}
build(b);
return 1;
}