# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403446 | victoriad | 슈퍼트리 잇기 (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 <cmath>
#include <cstdio>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<int> > answer;
for(int i=0;i<n;i++){
for(int k=0;k<n;k++){
int x=0;
if(i>0 && k==i-1){
x=1;
}
else if(i<n-1 && k==i+1){
x=1;
}
answer.push_back(x);
}
}
build(answer);
return 1;
}