# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421109 | Monchito | 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 <iostream>
#include <vector>
using namespace std;
void build(vector<vector<int>> b){
}
int construct(vector<vector<int>> p){
int N = (int)p.size();
vector<vector<int>> b = vector<vector<int>>(N, vector<int>(N, 0));
b[0][1] = 1;
for(int i=1; i<N; i++){
b[i][i-1] = 1;
if(i+1 < N) b[i][i+1] = 1;
}
build(b);
return 1;
}
/*
int main(){
return 0;
}
*/