# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732728 | raul2008487 | 슈퍼트리 잇기 (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<int> answer[n];
std::vector<std::vector<bool>> vis;
for (int i = 0; i < n; i++) {
std::vector<int> row;
ans[i].resize(n);
for(int j=0;j<n;j++){
if(j==i+1 && p[i][j]){
ans[i][j]=1;
}
else if(j==i-1 && p[i][j]){
ans[i][j]=1;
}
else{
ans[i][j]=0;
}
}
}
build(answer);
return 1;
}