# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064880 | 2024-08-18T18:54:32 Z | kkkkkkkk | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int> > paths) { int n=paths.size(); int a[n][n]; for (int i=0;i<n;i++) { for (int j=0;j<n;j++) { if (j==i+1||i==j+1) a[i][j]=1; else a[i][j]=0; } } build(a); return 1; }