# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432080 | peuch | 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(vector<vector<int> > p) {
int n = pointer.size();
vector<vector<int> > ans (n, vector<int> (n));
for(int i = 1; i < n; i++){
ans[i][i - 1] = 1;
ans[i - 1][i] = 1;
}
build(answer);
return 1;
}