結果
問題 | No.1789 Tree Growing |
ユーザー |
|
提出日時 | 2021-12-18 01:53:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 28,703 bytes |
コンパイル時間 | 3,453 ms |
コンパイル使用メモリ | 306,528 KB |
最終ジャッジ日時 | 2025-01-27 03:02:02 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 72 TLE * 13 |
ソースコード
/*** date : 2021-12-18 01:52:54*/#define NDEBUGusing namespace std;// intrinstic#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>// utilitynamespace Nyaan {using ll = long long;using i64 = long long;using u64 = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;template <typename T>using V = vector<T>;template <typename T>using VV = vector<vector<T>>;using vi = vector<int>;using vl = vector<long long>;using vd = V<double>;using vs = V<string>;using vvi = vector<vector<int>>;using vvl = vector<vector<long long>>;template <typename T, typename U>struct P : pair<T, U> {template <typename... Args>P(Args... args) : pair<T, U>(args...) {}using pair<T, U>::first;using pair<T, U>::second;T &x() { return first; }const T &x() const { return first; }U &y() { return second; }const U &y() const { return second; }P &operator+=(const P &r) {first += r.first;second += r.second;return *this;}P &operator-=(const P &r) {first -= r.first;second -= r.second;return *this;}P &operator*=(const P &r) {first *= r.first;second *= r.second;return *this;}P operator+(const P &r) const { return P(*this) += r; }P operator-(const P &r) const { return P(*this) -= r; }P operator*(const P &r) const { return P(*this) *= r; }P operator*(int r) const { return {first * r, second * r}; }P operator-() const { return P{-first, -second}; }};using pl = P<ll, ll>;using pi = P<int, int>;using vp = V<pl>;constexpr int inf = 1001001001;constexpr long long infLL = 4004004004004004004LL;template <typename T>int sz(const T &t) {return t.size();}template <typename T, typename U>inline bool amin(T &x, U y) {return (y < x) ? (x = y, true) : false;}template <typename T, typename U>inline bool amax(T &x, U y) {return (x < y) ? (x = y, true) : false;}template <typename T>inline T Max(const vector<T> &v) {return *max_element(begin(v), end(v));}template <typename T>inline T Min(const vector<T> &v) {return *min_element(begin(v), end(v));}template <typename T>inline long long Sum(const vector<T> &v) {return accumulate(begin(v), end(v), 0LL);}template <typename T>int lb(const vector<T> &v, const T &a) {return lower_bound(begin(v), end(v), a) - begin(v);}template <typename T>int ub(const vector<T> &v, const T &a) {return upper_bound(begin(v), end(v), a) - begin(v);}constexpr long long TEN(int n) {long long ret = 1, x = 10;for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);return ret;}template <typename T, typename U>pair<T, U> mkp(const T &t, const U &u) {return make_pair(t, u);}template <typename T>vector<T> mkrui(const vector<T> &v, bool rev = false) {vector<T> ret(v.size() + 1);if (rev) {for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];} else {for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];}return ret;};template <typename T>vector<T> mkuni(const vector<T> &v) {vector<T> ret(v);sort(ret.begin(), ret.end());ret.erase(unique(ret.begin(), ret.end()), ret.end());return ret;}template <typename F>vector<int> mkord(int N, F f) {vector<int> ord(N);iota(begin(ord), end(ord), 0);sort(begin(ord), end(ord), f);return ord;}template <typename T>vector<int> mkinv(vector<T> &v) {int max_val = *max_element(begin(v), end(v));vector<int> inv(max_val + 1, -1);for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;return inv;}} // namespace Nyaan// bit operationnamespace Nyaan {__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {return _mm_popcnt_u64(a);}inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }template <typename T>inline int gbit(const T &a, int i) {return (a >> i) & 1;}template <typename T>inline void sbit(T &a, int i, bool b) {if (gbit(a, i) != b) a ^= T(1) << i;}constexpr long long PW(int n) { return 1LL << n; }constexpr long long MSK(int n) { return (1LL << n) - 1; }} // namespace Nyaan// inoutnamespace Nyaan {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &... u) {cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &... u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template <typename T, class... U, char sep = ' '>void outr(const T &t, const U &... u) {cout << t;outr(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} // namespace Nyaan// debugnamespace DebugImpl {template <typename U, typename = void>struct is_specialize : false_type {};template <typename U>struct is_specialize<U, typename conditional<false, typename U::iterator, void>::type>: true_type {};template <typename U>struct is_specialize<U, typename conditional<false, decltype(U::first), void>::type>: true_type {};template <typename U>struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {};void dump(const char& t) { cerr << t; }void dump(const string& t) { cerr << t; }void dump(const bool& t) { cerr << (t ? "true" : "false"); }template <typename U,enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>void dump(const U& t) {cerr << t;}template <typename T>void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {string res;if (t == Nyaan::inf) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::inf) res = "-inf";}if constexpr (sizeof(T) == 8) {if (t == Nyaan::infLL) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::infLL) res = "-inf";}}if (res.empty()) res = to_string(t);cerr << res;}template <typename T, typename U>void dump(const pair<T, U>&);template <typename T>void dump(const pair<T*, int>&);template <typename T>void dump(const T& t,enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {cerr << "[ ";for (auto it = t.begin(); it != t.end();) {dump(*it);cerr << (++it == t.end() ? "" : ", ");}cerr << " ]";}template <typename T, typename U>void dump(const pair<T, U>& t) {cerr << "( ";dump(t.first);cerr << ", ";dump(t.second);cerr << " )";}template <typename T>void dump(const pair<T*, int>& t) {cerr << "[ ";for (int i = 0; i < t.second; i++) {dump(t.first[i]);cerr << (i == t.second - 1 ? "" : ", ");}cerr << " ]";}void trace() { cerr << endl; }template <typename Head, typename... Tail>void trace(Head&& head, Tail&&... tail) {cerr << " ";dump(head);if (sizeof...(tail) != 0) cerr << ",";trace(forward<Tail>(tail)...);}} // namespace DebugImpl#ifdef NyaanDebug#define trc(...) \do { \cerr << "## " << #__VA_ARGS__ << " = "; \DebugImpl::trace(__VA_ARGS__); \} while (0)#else#define trc(...) (void(0))#endif// macro#define each(x, v) for (auto&& x : v)#define each2(x, y, v) for (auto&& [x, y] : v)#define all(v) (v).begin(), (v).end()#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)#define reg(i, a, b) for (long long i = (a); i < (b); i++)#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)#define fi first#define se second#define ini(...) \int __VA_ARGS__; \in(__VA_ARGS__)#define inl(...) \long long __VA_ARGS__; \in(__VA_ARGS__)#define ins(...) \string __VA_ARGS__; \in(__VA_ARGS__)#define in2(s, t) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i]); \}#define in3(s, t, u) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i]); \}#define in4(s, t, u, v) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i], v[i]); \}#define die(...) \do { \Nyaan::out(__VA_ARGS__); \return; \} while (0)namespace Nyaan {void solve();}int main() { Nyaan::solve(); }//namespace atcoder {namespace internal {template <class E> struct csr {std::vector<int> start;std::vector<E> elist;csr(int n, const std::vector<std::pair<int, E>>& edges): start(n + 1), elist(edges.size()) {for (auto e : edges) {start[e.first + 1]++;}for (int i = 1; i <= n; i++) {start[i] += start[i - 1];}auto counter = start;for (auto e : edges) {elist[counter[e.first]++] = e.second;}}};} // namespace internal} // namespace atcodernamespace atcoder {namespace internal {template <class T> struct simple_queue {std::vector<T> payload;int pos = 0;void reserve(int n) { payload.reserve(n); }int size() const { return int(payload.size()) - pos; }bool empty() const { return pos == int(payload.size()); }void push(const T& t) { payload.push_back(t); }T& front() { return payload[pos]; }void clear() {payload.clear();pos = 0;}void pop() { pos++; }};} // namespace internal} // namespace atcodernamespace atcoder {template <class Cap, class Cost> struct mcf_graph {public:mcf_graph() {}mcf_graph(int n) : _n(n) {}int add_edge(int from, int to, Cap cap, Cost cost) {assert(0 <= from && from < _n);assert(0 <= to && to < _n);assert(0 <= cap);assert(0 <= cost);int m = int(_edges.size());_edges.push_back({from, to, cap, 0, cost});return m;}struct edge {int from, to;Cap cap, flow;Cost cost;};edge get_edge(int i) {int m = int(_edges.size());assert(0 <= i && i < m);return _edges[i];}std::vector<edge> edges() { return _edges; }std::pair<Cap, Cost> flow(int s, int t) {return flow(s, t, std::numeric_limits<Cap>::max());}std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {return slope(s, t, flow_limit).back();}std::vector<std::pair<Cap, Cost>> slope(int s, int t) {return slope(s, t, std::numeric_limits<Cap>::max());}std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {assert(0 <= s && s < _n);assert(0 <= t && t < _n);assert(s != t);int m = int(_edges.size());std::vector<int> edge_idx(m);auto g = [&]() {std::vector<int> degree(_n), redge_idx(m);std::vector<std::pair<int, _edge>> elist;elist.reserve(2 * m);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] = degree[e.from]++;redge_idx[i] = degree[e.to]++;elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});}auto _g = internal::csr<_edge>(_n, elist);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] += _g.start[e.from];redge_idx[i] += _g.start[e.to];_g.elist[edge_idx[i]].rev = redge_idx[i];_g.elist[redge_idx[i]].rev = edge_idx[i];}return _g;}();auto result = slope(g, s, t, flow_limit);for (int i = 0; i < m; i++) {auto e = g.elist[edge_idx[i]];_edges[i].flow = _edges[i].cap - e.cap;}return result;}private:int _n;std::vector<edge> _edges;// inside edgestruct _edge {int to, rev;Cap cap;Cost cost;};std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,int s,int t,Cap flow_limit) {// variants (C = maxcost):// -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0// reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge// dual_dist[i] = (dual[i], dist[i])std::vector<std::pair<Cost, Cost>> dual_dist(_n);std::vector<int> prev_e(_n);std::vector<bool> vis(_n);struct Q {Cost key;int to;bool operator<(Q r) const { return key > r.key; }};std::vector<int> que_min;std::vector<Q> que;auto dual_ref = [&]() {for (int i = 0; i < _n; i++) {dual_dist[i].second = std::numeric_limits<Cost>::max();}std::fill(vis.begin(), vis.end(), false);que_min.clear();que.clear();// que[0..heap_r) was heapifiedsize_t heap_r = 0;dual_dist[s].second = 0;que_min.push_back(s);while (!que_min.empty() || !que.empty()) {int v;if (!que_min.empty()) {v = que_min.back();que_min.pop_back();} else {while (heap_r < que.size()) {heap_r++;std::push_heap(que.begin(), que.begin() + heap_r);}v = que.front().to;std::pop_heap(que.begin(), que.end());que.pop_back();heap_r--;}if (vis[v]) continue;vis[v] = true;if (v == t) break;// dist[v] = shortest(s, v) + dual[s] - dual[v]// dist[v] >= 0 (all reduced cost are positive)// dist[v] <= (n-1)CCost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;for (int i = g.start[v]; i < g.start[v + 1]; i++) {auto e = g.elist[i];if (!e.cap) continue;// |-dual[e.to] + dual[v]| <= (n-1)C// cost <= C - -(n-1)C + 0 = nCCost cost = e.cost - dual_dist[e.to].first + dual_v;if (dual_dist[e.to].second - dist_v > cost) {Cost dist_to = dist_v + cost;dual_dist[e.to].second = dist_to;prev_e[e.to] = e.rev;if (dist_to == dist_v) {que_min.push_back(e.to);} else {que.push_back(Q{dist_to, e.to});}}}}if (!vis[t]) {return false;}for (int v = 0; v < _n; v++) {if (!vis[v]) continue;// dual[v] = dual[v] - dist[t] + dist[v]// = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +// (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,// t) + dual[t] + shortest(s, v) = shortest(s, v) -// shortest(s, t) >= 0 - (n-1)Cdual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;}return true;};Cap flow = 0;Cost cost = 0, prev_cost_per_flow = -1;std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};while (flow < flow_limit) {if (!dual_ref()) break;Cap c = flow_limit - flow;for (int v = t; v != s; v = g.elist[prev_e[v]].to) {c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);}for (int v = t; v != s; v = g.elist[prev_e[v]].to) {auto& e = g.elist[prev_e[v]];e.cap += c;g.elist[e.rev].cap -= c;}Cost d = -dual_dist[s].first;flow += c;cost += c * d;if (prev_cost_per_flow == d) {result.pop_back();}result.push_back({flow, cost});prev_cost_per_flow = d;}return result;}};} // namespace atcodertemplate <typename T>struct edge {int src, to;T cost;edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T>using Edges = vector<edge<T>>;template <typename T>using WeightedGraph = vector<Edges<T>>;using UnweightedGraph = vector<vector<int>>;// Input of (Unweighted) GraphUnweightedGraph graph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {UnweightedGraph g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;if (is_1origin) x--, y--;g[x].push_back(y);if (!is_directed) g[y].push_back(x);}return g;}// Input of Weighted Graphtemplate <typename T>WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {WeightedGraph<T> g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;cin >> c;if (is_1origin) x--, y--;g[x].emplace_back(x, y, c);if (!is_directed) g[y].emplace_back(y, x, c);}return g;}// Input of Edgestemplate <typename T>Edges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {Edges<T> es;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;es.emplace_back(x, y, c);}return es;}// Input of Adjacency Matrixtemplate <typename T>vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,bool is_directed = false, bool is_1origin = true) {vector<vector<T>> d(N, vector<T>(N, INF));for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;d[x][y] = c;if (!is_directed) d[y][x] = c;}return d;}/*** @brief グラフテンプレート* @docs docs/graph/graph-template.md*/namespace inner {using u64 = unsigned long long;using u128 = __uint128_t;template <int BASE_NUM = 2>struct Hash : array<u64, BASE_NUM> {using array<u64, BASE_NUM>::operator[];static constexpr int n = BASE_NUM;Hash() : array<u64, BASE_NUM>() {}static constexpr u64 md = (1ull << 61) - 1;constexpr static Hash set(const long long &a) {Hash res;for (int i = 0; i < n; i++) res[i] = cast(a);return res;}Hash &operator+=(const Hash &r) {for (int i = 0; i < n; i++)if (((*this)[i] += r[i]) >= md) (*this)[i] -= md;return *this;}Hash &operator+=(const u64 &r) {for (int i = 0; i < n; i++)if (((*this)[i] += r) >= md) (*this)[i] -= md;return *this;}Hash &operator-=(const Hash &r) {for (int i = 0; i < n; i++)if (((*this)[i] += md - r[i]) >= md) (*this)[i] -= md;return *this;}Hash &operator-=(const u64 &r) {for (int i = 0; i < n; i++)if (((*this)[i] += md - r) >= md) (*this)[i] -= md;return *this;}inline Hash &operator*=(const Hash &r) {for (int i = 0; i < n; i++) (*this)[i] = modmul((*this)[i], r[i]);return *this;}Hash operator+(const Hash &r) { return Hash(*this) += r; }Hash operator+(const u64 &r) { return Hash(*this) += r; }Hash operator-(const Hash &r) { return Hash(*this) -= r; }Hash operator-(const u64 &r) { return Hash(*this) -= r; }inline Hash operator*(const Hash &r) { return Hash(*this) *= r; }Hash operator-() const {Hash res;for (int i = 0; i < n; i++) res[i] = (*this)[i] == 0 ? 0 : md - (*this)[i];return res;}friend Hash pfma(const Hash &a, const Hash &b, const Hash &c) {Hash res;for (int i = 0; i < n; i++) res[i] = modfma(a[i], b[i], c[i]);return res;}friend Hash pfma(const Hash &a, const Hash &b, const long long &c) {Hash res;for (int i = 0; i < n; i++) res[i] = modfma(a[i], b[i], cast(c));return res;}static Hash get_basis() {static auto rand_time =chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();static mt19937_64 rng(rand_time);Hash h;for (int i = 0; i < n; i++) {while (isPrimitive(h[i] = rng() % (md - 1) + 1) == false);}return h;}private:static u64 modpow(u64 a, u64 b) {u64 r = 1;for (a %= md; b; a = modmul(a, a), b >>= 1) r = modmul(r, a);return r;}static bool isPrimitive(u64 x) {for (auto &d : vector<u64>{2, 3, 5, 7, 11, 13, 31, 41, 61, 151, 331, 1321})if (modpow(x, (md - 1) / d) <= 1) return false;return true;}static inline constexpr u64 cast(const long long &a) {return a < 0 ? a + md : a;}static inline constexpr u64 modmul(const u64 &a, const u64 &b) {u128 ret = u128(a) * b;ret = (ret & md) + (ret >> 61);return ret >= md ? ret - md : ret;}static inline constexpr u64 modfma(const u64 &a, const u64 &b, const u64 &c) {u128 ret = u128(a) * b + c;ret = (ret & md) + (ret >> 61);return ret >= md ? ret - md : ret;}};} // namespace inner/*** @brief ハッシュ構造体* @docs docs/inner/inner-hash.md*/template <typename T>struct has_cost {private:template <typename U>static auto confirm(U u) -> decltype(u.cost, std::true_type());static auto confirm(...) -> std::false_type;public:enum : bool { value = decltype(confirm(std::declval<T>()))::value };};template <typename T>vector<vector<T>> inverse_tree(const vector<vector<T>>& g) {int N = (int)g.size();vector<vector<T>> rg(N);for (int i = 0; i < N; i++) {for (auto& e : g[i]) {if constexpr (is_same<T, int>::value) {rg[e].push_back(i);} else if constexpr (has_cost<T>::value) {rg[e].emplace_back(e.to, i, e.cost);} else {assert(0);}}}return rg;}template <typename T>vector<vector<T>> rooted_tree(const vector<vector<T>>& g, int root = 0) {int N = (int)g.size();vector<vector<T>> rg(N);vector<char> v(N, false);v[root] = true;queue<int> que;que.emplace(root);while (!que.empty()) {auto p = que.front();que.pop();for (auto& e : g[p]) {if (v[e] == false) {v[e] = true;que.push(e);rg[p].push_back(e);}}}return rg;}/*** @brief 根付き木・逆辺からなる木への変換*/using Hash = inner::Hash<8>;vector<Hash> xs;struct Dummy {Dummy() {xs.resize(121);each(x, xs) x = Hash::get_basis();}} dummy;template <typename G>struct TreeHash {using u64 = unsigned long long;const G& g;int n;vector<Hash> hash;vector<int> depth;TreeHash(const G& _g, int root = 0) : g(_g), n(g.size()) {hash.resize(n);depth.resize(n, 0);// xs.resize(n);// for (auto& x : xs) x = Hash::get_basis();dfs(root, -1);}private:int dfs(int c, int p) {int dep = 0;for (auto& d : g[c]) {if (d != p) dep = max(dep, dfs(d, c) + 1);}Hash x = xs[dep], h = Hash::set(1);for (auto& d : g[c]) {if (d != p) h = h * (x + hash[d]);}hash[c] = h;return depth[c] = dep;}};using namespace Nyaan;vi sub(vvi g, int r) {int N = sz(g);vi res(N, -1);auto dfs = [&](auto rc, int c, int p = -1,[[maybe_unused]] ll dat = 0) -> void {res[c] = 1;for (auto& d : g[c]) {if (d == p) continue;rc(rc, d, c);res[c] += res[d];}};dfs(dfs, r);return res;}map<pair<Hash, Hash>, int> memo;int sol(int, vvi g, int, vvi h, int hr) {g = rooted_tree(g, 0);h = rooted_tree(h, hr);TreeHash hag(g, 0);TreeHash hah(h, hr);vi subg = sub(g, 0);vi subh = sub(h, hr);auto calc = [&](auto rc, int cg, int ch, bool ke = false) -> ll {pair<Hash, Hash> pa;if (!ke) {if (subg[cg] > subh[ch]) return inf;if (sz(g[cg]) > sz(h[ch])) return inf;pa = make_pair(hag.hash[cg], hah.hash[ch]);} else {if (subg[cg] + 1 > subh[ch]) return inf;auto h2 = hag.hash[cg] + xs[hag.depth[cg] + 1];pa = make_pair(hag.hash[cg], h2);}//if (memo.count(pa)) return memo[pa];using HS = pair<Hash, int>;map<HS, pl> mpg, mph;int kog = 0, koh = 0;if (ke) {mpg[{hag.hash[cg], subg[cg]}] = {1, cg};kog = 1;} else {each(d, g[cg]) {auto& p = mpg[{hag.hash[d], subg[d]}];p.first++;p.second = d;kog++;}}each(d, h[ch]) {auto& p = mph[{hah.hash[d], subh[d]}];p.first++;p.second = d;koh++;}V<pair<HS, pl>> mpg2, mph2;each(p, mpg) mpg2.push_back(p);each(p, mph) mph2.push_back(p);atcoder::mcf_graph<ll, ll> mcf(sz(mpg) + 1 + sz(mph) + 2);int sg = sz(mpg2) + 1;int sh = sz(mph2);int S = sg + sh + 0;int T = sg + sh + 1;rep(i, sg - 1) mcf.add_edge(S, i + 0u, mpg2[i].second.first, 0);rep(i, sh + 0) mcf.add_edge(i + sg, T, mph2[i].second.first, 0);mcf.add_edge(S, sg - 1, koh - kog, 0);rep(i, sg) rep(j, sh) {int cost = inf;if (i == sz(mpg2)) {cost = mph2[j].first.second;} else {int daig = mpg2[i].second.second;int daih = mph2[j].second.second;cost = rc(rc, daig, daih);amin(cost, rc(rc, daig, daih, true));}mcf.add_edge(i, sg + j, inf, cost);}auto [fl, ans] = mcf.flow(S, T);each(e, mcf.edges()) trc(e.from, e.to, e.cap, e.cost, e.flow);if (ans > inf) ans = inf;trc(cg, ch, ke, fl, ans);trc(mpg);trc(mph);return /*memo[pa] =*/ ans;};return calc(calc, 0, hr);}void Nyaan::solve() {inl(K);auto g = graph(K);inl(N);auto h = graph(N);ll ans = inf;rep(i, N) {// if (i != 0) continue;// if (i != 1) continue;int cur = sol(K, g, N, h, i);trc(i, cur);amin(ans, cur);}if (ans == inf)ans = -1;elseans = N - 1 - ans;out(ans);}