# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301247 | 2020-09-17T18:58:19 Z | qiangbao | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include "supertrees.h" #define pb push_back using namespace std; int n; vector<int> plamt; vector<vector<int> > ans; void construct(vector<vector<int> > p) { int i; n=p.size(); for(i=0;i<n;i++) plamt.pb(0); for(i=0;i<n;i++) ans.pb(plamt); for(i=2;i<=n;i++) ans[0][i-1]=ans[i-1][0]=1; build(ans); }