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