# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064887 | kkkkkkkk | 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> > paths) {
int n=paths.size();
vector<vector<int> > a=paths;
for (int i=0;i<n;i++) {
for (int j=0;j<n;j++) {
if (j==i+1||i==j+1)
a[i][j]=1;
else a[i][j]=0;
}
}
build(a);
return 1;
}