結果
問題 | No.1789 Tree Growing |
ユーザー |
![]() |
提出日時 | 2023-11-11 23:27:52 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 264 ms / 5,000 ms |
コード長 | 25,221 bytes |
コンパイル時間 | 5,536 ms |
コンパイル使用メモリ | 336,724 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-26 02:55:40 |
合計ジャッジ時間 | 15,248 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 85 |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41, from /home/maspy/compro/library/my_template.hpp:7: In static member function 'static constexpr _Tp* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(const _Tp*, const _Tp*, _Tp*) [with _Tp = int; bool _IsMove = true]', inlined from 'constexpr _OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = true; _II = int*; _OI = int*]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:495:30, inlined from 'constexpr _OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = true; _II = int*; _OI = int*]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:522:42, inlined from 'constexpr _OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = true; _II = __gnu_cxx::__normal_iterator<int*, vector<int> >; _OI = __gnu_cxx::__normal_iterator<int*, vector<int> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:529:31, inlined from 'constexpr _OI std::move(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator<int*, vector<int> >; _OI = __gnu_cxx::__normal_iterator<int*, vector<int> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:652:38, inlined from 'constexpr std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator) [with _Tp = int; _Alloc = std::allocator<int>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/vector.tcc:179:2, inlined from 'constexpr std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator) [with _Tp = int; _Alloc = std::allocator<int>]' at /home/linux
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/graph/base.hpp"template <typename T>struct Edge {int frm, to;T cost;int id;};template <typename T = int, bool directed = false>struct Graph {static constexpr bool is_directed = directed;int N, M;using cost_type = T;using edge_type = Edge<T>;vector<edge_type> edges;vector<int> indptr;vector<edge_type> csr_edges;vc<int> vc_deg, vc_indeg, vc_outdeg;bool prepared;class OutgoingEdges {public:OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}const edge_type* begin() const {if (l == r) { return 0; }return &G->csr_edges[l];}const edge_type* end() const {if (l == r) { return 0; }return &G->csr_edges[r];}private:const Graph* G;int l, r;};bool is_prepared() { return prepared; }Graph() : N(0), M(0), prepared(0) {}Graph(int N) : N(N), M(0), prepared(0) {}void build(int n) {N = n, M = 0;prepared = 0;edges.clear();indptr.clear();csr_edges.clear();vc_deg.clear();vc_indeg.clear();vc_outdeg.clear();}void add(int frm, int to, T cost = 1, int i = -1) {assert(!prepared);assert(0 <= frm && 0 <= to && to < N);if (i == -1) i = M;auto e = edge_type({frm, to, cost, i});edges.eb(e);++M;}#ifdef FASTIO// wt, offvoid read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }void read_graph(int M, bool wt = false, int off = 1) {for (int m = 0; m < M; ++m) {INT(a, b);a -= off, b -= off;if (!wt) {add(a, b);} else {T c;read(c);add(a, b, c);}}build();}#endifvoid build() {assert(!prepared);prepared = true;indptr.assign(N + 1, 0);for (auto&& e: edges) {indptr[e.frm + 1]++;if (!directed) indptr[e.to + 1]++;}for (int v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }auto counter = indptr;csr_edges.resize(indptr.back() + 1);for (auto&& e: edges) {csr_edges[counter[e.frm]++] = e;if (!directed)csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});}}OutgoingEdges operator[](int v) const {assert(prepared);return {this, indptr[v], indptr[v + 1]};}vc<int> deg_array() {if (vc_deg.empty()) calc_deg();return vc_deg;}pair<vc<int>, vc<int>> deg_array_inout() {if (vc_indeg.empty()) calc_deg_inout();return {vc_indeg, vc_outdeg};}int deg(int v) {if (vc_deg.empty()) calc_deg();return vc_deg[v];}int in_deg(int v) {if (vc_indeg.empty()) calc_deg_inout();return vc_indeg[v];}int out_deg(int v) {if (vc_outdeg.empty()) calc_deg_inout();return vc_outdeg[v];}#ifdef FASTIOvoid debug() {print("Graph");if (!prepared) {print("frm to cost id");for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);} else {print("indptr", indptr);print("frm to cost id");FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);}}#endifvc<int> new_idx;vc<bool> used_e;// G における頂点 V[i] が、新しいグラフで i になるようにする// {G, es}Graph<T, directed> rearrange(vc<int> V, bool keep_eid = 0) {if (len(new_idx) != N) new_idx.assign(N, -1);if (len(used_e) != M) used_e.assign(M, 0);int n = len(V);FOR(i, n) new_idx[V[i]] = i;Graph<T, directed> G(n);vc<int> history;FOR(i, n) {for (auto&& e: (*this)[V[i]]) {if (used_e[e.id]) continue;int a = e.frm, b = e.to;if (new_idx[a] != -1 && new_idx[b] != -1) {history.eb(e.id);used_e[e.id] = 1;int eid = (keep_eid ? e.id : -1);G.add(new_idx[a], new_idx[b], e.cost, eid);}}}FOR(i, n) new_idx[V[i]] = -1;for (auto&& eid: history) used_e[eid] = 0;G.build();return G;}private:void calc_deg() {assert(vc_deg.empty());vc_deg.resize(N);for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;}void calc_deg_inout() {assert(vc_indeg.empty());vc_indeg.resize(N);vc_outdeg.resize(N);for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }}};#line 3 "/home/maspy/compro/library/graph/shortest_path/warshall_floyd.hpp"// 負辺があっても負閉路がなければ正しく動作する。// 負閉路があるかどうかは、dist[v][v] < 0 となる v があるかどうかで判定。template <typename T, typename GT>vc<vc<T>> warshall_floyd(GT& G) {ll N = G.N;vv(T, dist, N, N, infty<T>);FOR(v, N) {dist[v][v] = 0;for (auto&& e: G[v]) chmin(dist[v][e.to], e.cost);}FOR(k, N) FOR(i, N) {if (dist[i][k] == infty<T>) continue;FOR(j, N) {if (dist[k][j] == infty<T>) continue;chmin(dist[i][j], dist[i][k] + dist[k][j]);}}return dist;}#line 2 "/home/maspy/compro/library/graph/tree.hpp"#line 4 "/home/maspy/compro/library/graph/tree.hpp"// HLD euler tour をとっていろいろ。template <typename GT>struct Tree {using Graph_type = GT;GT &G;using WT = typename GT::cost_type;int N;vector<int> LID, RID, head, V, parent, VtoE;vc<int> depth;vc<WT> depth_weighted;Tree(GT &G, int r = 0, bool hld = 1) : G(G) { build(r, hld); }void build(int r = 0, bool hld = 1) {if (r == -1) return; // build を遅延したいときN = G.N;LID.assign(N, -1), RID.assign(N, -1), head.assign(N, r);V.assign(N, -1), parent.assign(N, -1), VtoE.assign(N, -1);depth.assign(N, -1), depth_weighted.assign(N, 0);assert(G.is_prepared());int t1 = 0;dfs_sz(r, -1, hld);dfs_hld(r, t1);}void dfs_sz(int v, int p, bool hld) {auto &sz = RID;parent[v] = p;depth[v] = (p == -1 ? 0 : depth[p] + 1);sz[v] = 1;int l = G.indptr[v], r = G.indptr[v + 1];auto &csr = G.csr_edges;// 使う辺があれば先頭にするfor (int i = r - 2; i >= l; --i) {if (hld && depth[csr[i + 1].to] == -1) swap(csr[i], csr[i + 1]);}int hld_sz = 0;for (int i = l; i < r; ++i) {auto e = csr[i];if (depth[e.to] != -1) continue;depth_weighted[e.to] = depth_weighted[v] + e.cost;VtoE[e.to] = e.id;dfs_sz(e.to, v, hld);sz[v] += sz[e.to];if (hld && chmax(hld_sz, sz[e.to]) && l < i) { swap(csr[l], csr[i]); }}}void dfs_hld(int v, int ×) {LID[v] = times++;RID[v] += LID[v];V[LID[v]] = v;bool heavy = true;for (auto &&e: G[v]) {if (depth[e.to] <= depth[v]) continue;head[e.to] = (heavy ? head[v] : e.to);heavy = false;dfs_hld(e.to, times);}}vc<int> heavy_path_at(int v) {vc<int> P = {v};while (1) {int a = P.back();for (auto &&e: G[a]) {if (e.to != parent[a] && head[e.to] == v) {P.eb(e.to);break;}}if (P.back() == a) break;}return P;}int heavy_child(int v) {int k = LID[v] + 1;if (k == N) return -1;int w = V[k];return (parent[w] == v ? w : -1);}int e_to_v(int eid) {auto e = G.edges[eid];return (parent[e.frm] == e.to ? e.frm : e.to);}int v_to_e(int v) { return VtoE[v]; }int ELID(int v) { return 2 * LID[v] - depth[v]; }int ERID(int v) { return 2 * RID[v] - depth[v] - 1; }// 目標地点へ進む個数が kint LA(int v, int k) {assert(k <= depth[v]);while (1) {int u = head[v];if (LID[v] - k >= LID[u]) return V[LID[v] - k];k -= LID[v] - LID[u] + 1;v = parent[u];}}int la(int u, int v) { return LA(u, v); }int LCA(int u, int v) {for (;; v = parent[head[v]]) {if (LID[u] > LID[v]) swap(u, v);if (head[u] == head[v]) return u;}}// root を根とした場合の lcaint LCA_root(int u, int v, int root) {return LCA(u, v) ^ LCA(u, root) ^ LCA(v, root);}int lca(int u, int v) { return LCA(u, v); }int lca_root(int u, int v, int root) { return LCA_root(u, v, root); }int subtree_size(int v, int root = -1) {if (root == -1) return RID[v] - LID[v];if (v == root) return N;int x = jump(v, root, 1);if (in_subtree(v, x)) return RID[v] - LID[v];return N - RID[x] + LID[x];}int dist(int a, int b) {int c = LCA(a, b);return depth[a] + depth[b] - 2 * depth[c];}WT dist_weighted(int a, int b) {int c = LCA(a, b);return depth_weighted[a] + depth_weighted[b] - WT(2) * depth_weighted[c];}// a is in bbool in_subtree(int a, int b) { return LID[b] <= LID[a] && LID[a] < RID[b]; }int jump(int a, int b, ll k) {if (k == 1) {if (a == b) return -1;return (in_subtree(b, a) ? LA(b, depth[b] - depth[a] - 1) : parent[a]);}int c = LCA(a, b);int d_ac = depth[a] - depth[c];int d_bc = depth[b] - depth[c];if (k > d_ac + d_bc) return -1;if (k <= d_ac) return LA(a, k);return LA(b, d_ac + d_bc - k);}vc<int> collect_child(int v) {vc<int> res;for (auto &&e: G[v])if (e.to != parent[v]) res.eb(e.to);return res;}vc<pair<int, int>> get_path_decomposition(int u, int v, bool edge) {// [始点, 終点] の"閉"区間列。vc<pair<int, int>> up, down;while (1) {if (head[u] == head[v]) break;if (LID[u] < LID[v]) {down.eb(LID[head[v]], LID[v]);v = parent[head[v]];} else {up.eb(LID[u], LID[head[u]]);u = parent[head[u]];}}if (LID[u] < LID[v]) down.eb(LID[u] + edge, LID[v]);elif (LID[v] + edge <= LID[u]) up.eb(LID[u], LID[v] + edge);reverse(all(down));up.insert(up.end(), all(down));return up;}vc<int> restore_path(int u, int v) {vc<int> P;for (auto &&[a, b]: get_path_decomposition(u, v, 0)) {if (a <= b) {FOR(i, a, b + 1) P.eb(V[i]);} else {FOR_R(i, b, a + 1) P.eb(V[i]);}}return P;}};#line 7 "main.cpp"#line 1 "/home/maspy/compro/library/flow/hungarian.hpp"// (ans, match, X, Y)// 最小重み最大マッチング。O(N^2M) time。// ポテンシャルは次の双対問題の解である:// maximize \sum x_i + \sum y_j, subj to x_i + y_j\leq C_{ij}// returns:template <typename T>tuple<T, vc<int>, vc<T>, vc<T>> hungarian(vvc<T>& C) {int N = len(C);int M = len(C[0]);assert(N <= M);vv(T, A, N + 1, M + 1);FOR(i, N) FOR(j, M) A[1 + i][1 + j] = C[i][j];++N, ++M;vector<int> P(M), way(M);vector<T> X(N), Y(M);vc<T> minV;vc<bool> used;for (int i = 1; i < N; i++) {P[0] = i;minV.assign(M, infty<T>);used.assign(M, false);int j0 = 0;while (P[j0] != 0) {int i0 = P[j0], j1 = 0;used[j0] = true;T delta = infty<T>;for (int j = 1; j < M; j++) {if (used[j]) continue;T curr = A[i0][j] - X[i0] - Y[j];if (curr < minV[j]) minV[j] = curr, way[j] = j0;if (minV[j] < delta) delta = minV[j], j1 = j;}for (int j = 0; j < M; j++) {if (used[j])X[P[j]] += delta, Y[j] -= delta;elseminV[j] -= delta;}j0 = j1;}do {P[j0] = P[way[j0]];j0 = way[j0];} while (j0 != 0);}T res = -Y[0];X.erase(X.begin());Y.erase(Y.begin());vc<int> match(N);FOR(i, N) match[P[i]] = i;match.erase(match.begin());for (auto&& i: match) --i;return {res, match, X, Y};}#line 9 "main.cpp"void solve() {INT(N1);Graph<int, 0> G1(N1);G1.read_tree();INT(N2);Graph<int, 0> G2(N2);G2.read_tree();auto dist = warshall_floyd<int>(G2);int ANS = -1;FOR(r2, N2) {// r2 を根付き木として解く// v1, v2 -> 辺の個数の maxTree<decltype(G1)> T1(G1, 0);Tree<decltype(G2)> T2(G2, r2);auto V1 = T1.V;auto V2 = T2.V;vv(ll, dp, N1, N2, -infty<int>);FOR_R(idx2, N2) {int v2 = V2[idx2];auto ch2 = T2.collect_child(v2);int n2 = len(ch2);// 方向ごとに頂点を集めておくvvc<int> vs(n2);FOR(i, n2) {int c = ch2[i];int L = T2.LID[c], R = T2.RID[c];FOR(p, L, R) { vs[i].eb(T2.V[p]); }}FOR_R(idx1, N1) {int v1 = V1[idx1];auto ch1 = T1.collect_child(v1);int n1 = len(ch1);if (n1 == 0) {dp[v1][v2] = 0;continue;}if (n1 > n2) continue;vv(ll, mat, n1, n2, +infty<int>);FOR(i, n1) {int w1 = ch1[i];FOR(j, n2) {for (auto& w2: vs[j]) {chmin(mat[i][j], -dp[w1][w2] - dist[v2][w2]);}}}auto [ans, match, X, Y] = hungarian<ll>(mat);if (ans > 0) continue;dp[v1][v2] = -ans;}}chmax(ANS, dp[0][r2]);}print(ANS);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}