# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693983 | T0p_ | 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 construct(vector<vector<int>> p)
{
int n = p.size();
int b[n][n];
for (int i=0 ; i<n ; i++)
{
for (int j=0 ; j<n ; j++) b[i][j] = 0;
b[i][i+1] = 1;
}
build(b);
return 1;
}