# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300315 | 2020-09-17T05:12:33 Z | junseo | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KB |
#include "supertrees.h" #include <bits/stdc++.h> #define fi first #define se second #define eb emplace_back #define all(v) (v).begin(), (v).end() #define rmin(r, x) r = min(r, x) #define rmax(r, x) r = max(r, x) #define ends ' ' #define endl '\n' #define fastio ios_base::sync_with_stdio(0), cin.tie(0) using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int maxn = 1e3 + 10; int n; vector<vector<int> b; int construct(vector<std::vector<int>> p) { n = p.size(); b.resize(n); for(int i = 0; i < n; ++i) b[i].resize(n); for(int i = 0; i < n - 1; ++i) b[i][i + 1] = b[i + 1][i] = 1; build(b); return 1; }