# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314032 | linear00000 | 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"
#include <bits/stdc++.h>
using namespace std;
int d[1004][1004];
int construct(vector<vector<int> > v) {
int n = v.size();
for (int i=0; i<n; i++) {
d[0][i] = 1, d[i][0] = 1;
}
build(d);
return 1;
}