# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300248 | easrui | 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 "supertrees.h"
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<vector<int>> ans(n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
ans[i].push_back(i==j+1||i==j-1);
}
}
build(ans);
return 1;
}