# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585950 | serize | 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 <vector>
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
int mat[n+1][n+1];
memset(mat,0,sizeof(mat));
for(int i = 0; i < n-1; i++){
mat[i][i+1] = 1;
mat[i+1][i] = 1;
}
for(int i = 0; i < n; i++){
vector <int> asd;
for(int j = 0; j < n; j++){
asd.push_back(mat[i][j]);
}
answer.push_back(asd);
}
build(answer);
return 1;
}