# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447347 | 2021-07-26T06:50:36 Z | Nodir_Bobiev | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std ; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<std::vector<int>> answer; for (int i = 0; i < n ; i++ ) { vector<int> row; row.resize(n); for(int j = 0; j < n; j ++){ else if( i == 1 ){ if( j != 1 ) row[j] = 1; } else{ if( j == 1 ) row[j] = 1; } } answer.push_back(row); } build(answer); return 1; }