# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302264 | EJOI2019Andrew | 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 <vector>
#include<bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
vector<vector<int>> answer;
answer.assign(p.size()+1,vector<int>());
for(int i=0; i<p.size(); ++i)
{
for(int j=0; j<p.size(); ++j)
answer[i][j]=0;
}
for(int i=0; i<n-1; ++i)
answer[i][i+1]=1;
build(answer);
return 1;
}