結果
問題 | No.2116 Making Forest Hard |
ユーザー | maspy |
提出日時 | 2022-10-29 00:58:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 992 ms / 8,000 ms |
コード長 | 33,601 bytes |
コンパイル時間 | 4,477 ms |
コンパイル使用メモリ | 294,260 KB |
実行使用メモリ | 97,152 KB |
最終ジャッジ日時 | 2024-07-06 03:58:18 |
合計ジャッジ時間 | 23,781 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 992 ms
97,060 KB |
testcase_03 | AC | 575 ms
72,320 KB |
testcase_04 | AC | 199 ms
48,356 KB |
testcase_05 | AC | 309 ms
48,664 KB |
testcase_06 | AC | 395 ms
67,328 KB |
testcase_07 | AC | 366 ms
65,412 KB |
testcase_08 | AC | 275 ms
53,780 KB |
testcase_09 | AC | 268 ms
62,212 KB |
testcase_10 | AC | 23 ms
7,808 KB |
testcase_11 | AC | 227 ms
40,356 KB |
testcase_12 | AC | 335 ms
63,292 KB |
testcase_13 | AC | 324 ms
48,568 KB |
testcase_14 | AC | 637 ms
75,140 KB |
testcase_15 | AC | 7 ms
5,376 KB |
testcase_16 | AC | 387 ms
71,964 KB |
testcase_17 | AC | 441 ms
56,300 KB |
testcase_18 | AC | 749 ms
80,596 KB |
testcase_19 | AC | 144 ms
31,916 KB |
testcase_20 | AC | 159 ms
31,340 KB |
testcase_21 | AC | 246 ms
34,160 KB |
testcase_22 | AC | 228 ms
42,064 KB |
testcase_23 | AC | 43 ms
12,032 KB |
testcase_24 | AC | 87 ms
14,208 KB |
testcase_25 | AC | 194 ms
38,196 KB |
testcase_26 | AC | 402 ms
72,160 KB |
testcase_27 | AC | 83 ms
15,356 KB |
testcase_28 | AC | 571 ms
60,512 KB |
testcase_29 | AC | 264 ms
42,416 KB |
testcase_30 | AC | 721 ms
76,892 KB |
testcase_31 | AC | 83 ms
16,736 KB |
testcase_32 | AC | 313 ms
48,628 KB |
testcase_33 | AC | 15 ms
5,376 KB |
testcase_34 | AC | 95 ms
21,452 KB |
testcase_35 | AC | 333 ms
48,636 KB |
testcase_36 | AC | 267 ms
53,908 KB |
testcase_37 | AC | 15 ms
6,144 KB |
testcase_38 | AC | 353 ms
71,272 KB |
testcase_39 | AC | 315 ms
48,728 KB |
testcase_40 | AC | 80 ms
15,428 KB |
testcase_41 | AC | 213 ms
36,744 KB |
testcase_42 | AC | 761 ms
82,180 KB |
testcase_43 | AC | 935 ms
97,152 KB |
testcase_44 | AC | 284 ms
46,516 KB |
testcase_45 | AC | 146 ms
25,844 KB |
testcase_46 | AC | 932 ms
97,060 KB |
testcase_47 | AC | 92 ms
19,540 KB |
testcase_48 | AC | 69 ms
14,908 KB |
testcase_49 | AC | 1 ms
5,376 KB |
testcase_50 | AC | 330 ms
48,640 KB |
testcase_51 | AC | 313 ms
48,512 KB |
testcase_52 | AC | 306 ms
48,764 KB |
testcase_53 | AC | 309 ms
48,616 KB |
testcase_54 | AC | 628 ms
75,652 KB |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using pi = pair<ll, ll>;using vi = vector<ll>;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;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 vec(type, name, ...) vector<type> name(__VA_ARGS__)#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 FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))#define overload4(a, b, c, d, e, ...) e#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) \overload4(__VA_ARGS__, FOR4_R, 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 stolltemplate <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#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())int 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); }// (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 pick(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T pick(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T pick(pqg<T> &que) {assert(que.size());T a = que.top();que.pop();return a;}template <typename T>T pick(vc<T> &que) {assert(que.size());T a = que.back();que.pop_back();return a;}template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename F>ll binary_search(F check, ll ok, ll ng) {assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, 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;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, 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);}vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = S[i] - first_char; }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;}template <typename CNT, typename T>vc<CNT> bincount(const vc<T> &A, int size) {vc<CNT> C(size);for (auto &&x: A) { ++C[x]; }return C;}// stabletemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(A.size());iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {int n = len(I);vc<T> B(n);FOR(i, n) B[i] = A[I[i]];return B;}#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace detail {template <typename T, decltype(&T::is_modint) = &T::is_modint>std::true_type check_value(int);template <typename T>std::false_type check_value(long);} // namespace detailtemplate <typename T>struct is_modint : decltype(detail::check_value<T>(0)) {};template <typename T>using is_modint_t = enable_if_t<is_modint<T>::value>;template <typename T>using is_not_modint_t = enable_if_t<!is_modint<T>::value>;struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <class T, is_modint_t<T> * = nullptr>bool read_single(T &ref) {long long val = 0;bool f = read_single(val);ref = T(val);return f;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <class A, class B, class C>bool read_single(tuple<A, B, C> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)));}template <class A, class B, class C, class D>bool read_single(tuple<A, B, C, D> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)) && read_single(get<3>(p)));}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char &val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string &s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <class T, is_modint_t<T> * = nullptr>void write(T &ref) {write(ref.val);}template <class T>void write(const vector<T> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> &val) {write(val.first);write(' ');write(val.second);}template <class A, class B, class C>void write(const tuple<A, B, C> &val) {auto &[a, b, c] = val;write(a), write(' '), write(b), write(' '), write(c);}template <class A, class B, class C, class D>void write(const tuple<A, B, C, D> &val) {auto &[a, b, c, d] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);}template <class A, class B, class C, class D, class E>void write(const tuple<A, B, C, D, E> &val) {auto &[a, b, c, d, e] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);}template <class A, class B, class C, class D, class E, class F>void write(const tuple<A, B, C, D, E, F> &val) {auto &[a, b, c, d, e, f] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);}template <class T, size_t S>void write(const array<T, S> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if(val < 0){negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if(negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __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 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 {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; }constexpr bool is_directed() { return directed; }Graph() : N(0), M(0), prepared(0) {}Graph(int N) : N(N), M(0), prepared(0) {}void resize(int n) { N = n; }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;}// 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();}void read_parent(int off = 1) {for (int v = 1; v < N; ++v) {INT(p);p -= off;add(p, v);}build();}void 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];}void 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);}}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 2 "/home/maspy/compro/library/mod/modint.hpp"template <int mod>struct modint {static constexpr bool is_modint = true;int val;constexpr modint(const ll val = 0) noexcept: val(val >= 0 ? val % mod : (mod - (-val) % mod) % mod) {}bool operator<(const modint &other) const {return val < other.val;} // To use std::mapmodint &operator+=(const modint &p) {if ((val += p.val) >= mod) val -= mod;return *this;}modint &operator-=(const modint &p) {if ((val += mod - p.val) >= mod) val -= mod;return *this;}modint &operator*=(const modint &p) {val = (int)(1LL * val * p.val % mod);return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint(-val); }modint operator+(const modint &p) const { return modint(*this) += p; }modint operator-(const modint &p) const { return modint(*this) -= p; }modint operator*(const modint &p) const { return modint(*this) *= p; }modint operator/(const modint &p) const { return modint(*this) /= p; }bool operator==(const modint &p) const { return val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return modint(u);}modint pow(int64_t n) const {modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}static constexpr int get_mod() { return mod; }};struct ArbitraryModInt {static constexpr bool is_modint = true;int val;ArbitraryModInt() : val(0) {}ArbitraryModInt(int64_t y): val(y >= 0 ? y % get_mod(): (get_mod() - (-y) % get_mod()) % get_mod()) {}bool operator<(const ArbitraryModInt &other) const {return val < other.val;} // To use std::map<ArbitraryModInt, T>static int &get_mod() {static int mod = 0;return mod;}static void set_mod(int md) { get_mod() = md; }ArbitraryModInt &operator+=(const ArbitraryModInt &p) {if ((val += p.val) >= get_mod()) val -= get_mod();return *this;}ArbitraryModInt &operator-=(const ArbitraryModInt &p) {if ((val += get_mod() - p.val) >= get_mod()) val -= get_mod();return *this;}ArbitraryModInt &operator*=(const ArbitraryModInt &p) {long long a = (long long)val * p.val;int xh = (int)(a >> 32), xl = (int)a, d, m;asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(get_mod()));val = m;return *this;}ArbitraryModInt &operator/=(const ArbitraryModInt &p) {*this *= p.inverse();return *this;}ArbitraryModInt operator-() const { return ArbitraryModInt(get_mod() - val); }ArbitraryModInt operator+(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) += p;}ArbitraryModInt operator-(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) -= p;}ArbitraryModInt operator*(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) *= p;}ArbitraryModInt operator/(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) /= p;}bool operator==(const ArbitraryModInt &p) const { return val == p.val; }bool operator!=(const ArbitraryModInt &p) const { return val != p.val; }ArbitraryModInt inverse() const {int a = val, b = get_mod(), u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return ArbitraryModInt(u);}ArbitraryModInt pow(int64_t n) const {ArbitraryModInt ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (int(dat.size()) <= n) {int k = dat.size();auto q = (mod + k - 1) / k;int r = k * q - mod;dat.emplace_back(dat[r] * mint(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {1, 1};assert(0 <= n);if (n >= mod) return 0;while (int(dat.size()) <= n) {int k = dat.size();dat.emplace_back(dat[k - 1] * mint(k));}return dat[n];}template <typename mint>mint fact_inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {1, 1};assert(0 <= n && n < mod);while (int(dat.size()) <= n) {int k = dat.size();dat.emplace_back(dat[k - 1] * inv<mint>(k));}return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto calc = [&](int i, int j) -> mint {if (i == 0) return (j == 0 ? mint(1) : mint(0));return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);};if (W <= k) {FOR(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if (dense) return C_dense<mint>(n, k);if (!large) return fact<mint>(n) * fact_inv<mint>(k) * fact_inv<mint>(n - k);k = min(k, n - k);mint x(1);FOR(i, k) { x *= mint(n - i); }x *= fact_inv<mint>(k);return x;}template <typename mint, bool large = false>mint C_inv(ll n, ll k) {assert(n >= 0);assert(0 <= k && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<mint, 1>(n, k);}// [x^d] (1-x) ^ {-n} の計算template <typename mint, bool large = false, bool dense = false>mint C_negative(ll n, ll d) {assert(n >= 0);if (d < 0) return mint(0);if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }return C<mint, large, dense>(n + d - 1, d);}using modint107 = modint<1000000007>;using modint998 = modint<998244353>;using amint = ArbitraryModInt;#line 2 "/home/maspy/compro/library/nt/primetable.hpp"vc<ll> primetable(int LIM) {++LIM;const int S = 32768;static int done = 2;static vc<ll> primes = {2}, sieve(S + 1);if (done < LIM) {done = LIM;primes = {2}, sieve.assign(S + 1, 0);const int R = LIM / 2;primes.reserve(int(LIM / log(LIM) * 1.1));vc<pi> cp;for (int i = 3; i <= S; i += 2) {if (!sieve[i]) {cp.eb(i, i * i / 2);for (int j = i * i; j <= S; j += 2 * i) sieve[j] = 1;}}for (int L = 1; L <= R; L += S) {array<bool, S> block{};for (auto& [p, idx]: cp)for (int i = idx; i < S + L; idx = (i += p)) block[i - L] = 1;FOR(i, min(S, R - L)) if (!block[i]) primes.eb((L + i) * 2 + 1);}}int k = LB(primes, LIM + 1);return {primes.begin(), primes.begin() + k};}#line 3 "/home/maspy/compro/library/mod/powertable.hpp"// a^0, ..., a^Ntemplate <typename mint>vc<mint> powertable_1(mint a, ll N) {// table of a^ivc<mint> f(N + 1, 1);FOR(i, N) f[i + 1] = a * f[i];return f;}// 0^e, ..., N^etemplate <typename mint>vc<mint> powertable_2(ll e, ll N) {auto primes = primetable(N);vc<mint> f(N + 1, 1);f[0] = mint(0).pow(e);for (auto&& p: primes) {if (p > N) break;mint xp = mint(p).pow(e);ll pp = p;while (pp <= N) {ll i = pp;while (i <= N) {f[i] *= xp;i += pp;}pp *= p;}}return f;}#line 3 "/home/maspy/compro/library/graph/tree.hpp"// HLD euler tour をとっていろいろ。// 木以外、非連結でも dfs 順序や親がとれる。template <typename GT>struct TREE {GT &G;using WT = typename GT::cost_type;int N;bool hld;vector<int> LID, RID, head, V, parent, root;vc<int> depth;vc<WT> depth_weighted;vector<bool> in_tree;TREE(GT &G, int r = -1, bool hld = 1): G(G),N(G.N),hld(hld),LID(G.N),RID(G.N),head(G.N, r),V(G.N),parent(G.N, -1),root(G.N, -1),depth(G.N, -1),depth_weighted(G.N, 0),in_tree(G.M, 0) {assert(G.is_prepared());int t1 = 0;if (r != -1) {dfs_sz(r, -1);dfs_hld(r, t1);} else {for (int r = 0; r < N; ++r) {if (parent[r] == -1) {head[r] = r;dfs_sz(r, -1);dfs_hld(r, t1);}}}for (auto &&v: V) root[v] = (parent[v] == -1 ? v : root[parent[v]]);}void dfs_sz(int v, int p) {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;in_tree[e.id] = 1;depth_weighted[e.to] = depth_weighted[v] + e.cost;dfs_sz(e.to, v);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 (!in_tree[e.id] || 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 e_to_v(int eid) {auto e = G.edges[eid];return (parent[e.frm] == e.to ? e.frm : e.to);}int ELID(int v) { return 2 * LID[v] - depth[v]; }int ERID(int v) { return 2 * RID[v] - depth[v] - 1; }/* k: 0-indexed */int 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 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;}}int lca(int u, int v) { return LCA(u, v); }int la(int u, int v) { return LA(u, v); }int subtree_size(int v) { return RID[v] - LID[v]; }int dist(int a, int b) {int c = LCA(a, b);return depth[a] + depth[b] - 2 * depth[c];}WT dist(int a, int b, bool weighted) {assert(weighted);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 = 1) {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;}void debug() {print("V", V);print("LID", LID);print("RID", RID);print("parent", parent);print("depth", depth);print("head", head);print("in_tree(edge)", in_tree);print("root", root);}};#line 2 "/home/maspy/compro/library/ds/dualsegtree.hpp"template <typename Monoid>struct DualSegTree {using A = typename Monoid::value_type;int n, log, size;vc<A> laz;DualSegTree() : DualSegTree(0) {}DualSegTree(int n) { resize(n); }void reset() { fill(all(laz), Monoid::unit()); }void resize(int n_) {n = n_;log = 1;while ((1 << log) < n) ++log;size = 1 << log;laz.assign(size << 1, Monoid::unit());}void all_apply(int k, A a) { laz[k] = Monoid::op(laz[k], a); }A get(int p) {assert(0 <= p && p < n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return laz[p];}vc<A> get_all() {FOR(i, size) push(i);return {laz.begin() + size, laz.begin() + size + n};}void apply(int l, int r, A a) {assert(0 <= l && l <= r && r <= n);if (l == r) return;l += size;r += size;if (!Monoid::commute) {for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, a);if (r & 1) all_apply(--r, a);l >>= 1;r >>= 1;}l = l2;r = r2;}}void debug() { print("dualsegtree getall:", get_all()); }private:void push(int k) {all_apply(2 * k, laz[k]);all_apply(2 * k + 1, laz[k]);laz[k] = Monoid::unit();}};#line 8 "main.cpp"using mint = modint998;struct Mono {using value_type = array<mint, 8>;using X = value_type;static X op(X a, X b) {X c;c[0] = a[0] + b[0] * a[3] + b[1] * a[5];c[1] = a[1] + b[1] * a[6];c[2] = a[2] + b[0] * a[4] + b[1] * a[7] + b[2];c[3] = a[3] * b[3];c[4] = b[3] * a[4] + b[4];c[5] = b[5] * a[3] + b[6] * a[5];c[6] = b[6] * a[6];c[7] = b[5] * a[4] + b[6] * a[7] + b[7];return c;}static constexpr X unit() { return {0, 0, 0, 1, 0, 0, 1, 0}; }static tuple<mint, mint, mint> eval(X x) {return {x[0] + x[2], x[3] + x[4], x[5] + x[7]};}static constexpr bool commute = 0;};void solve() {LL(N);VEC(ll, A, N);Graph<bool, 0> G(N);G.read_tree();// 2^{1-deg} の重みvc<mint> wt(N);{auto iPOW = powertable_1(mint(2).inverse(), N);auto deg = G.deg_array();FOR(v, N) wt[v] = iPOW[deg[v] - 1];}TREE<decltype(G)> tree(G);auto& head = tree.head;// heavy path の根にあるデータ構造を使うvvc<int> keys(N);FOR(v, N) {if (head[v] == v) {FOR(i, tree.LID[v], tree.RID[v]) { keys[v].eb(A[tree.V[i]]); }UNIQUE(keys[v]);}}vc<DualSegTree<Mono>> dps(N);FOR(v, N) dps[v].resize(len(keys[v]));using mat = Mono::value_type;auto dfs = [&](auto& dfs, int v, int p) -> void {auto& seg = dps[head[v]];auto& key = keys[head[v]];for (auto&& e: G[v]) {if (e.to == p) continue;dfs(dfs, e.to, v);if (head[e.to] == head[v]) continue;auto xs = keys[e.to];auto ys = dps[e.to].get_all();FOR(i, len(xs)) {int l = LB(key, xs[i]);int r = (i + 1 < len(xs) ? LB(key, xs[i + 1]) : len(key));auto [G, g, dg] = Mono::eval(ys[i]);seg.apply(l, r, {mint(0), mint(0), G, g, mint(0), dg, g, mint(0)});}}mint w = wt[v];seg.apply(0, len(key),{mint(0), mint(0), mint(0), w, mint(0), w, w, mint(0)});int idx = LB(key, A[v]);seg.apply(0, idx,{mint(0), mint(0), mint(0), mint(0), mint(0), mint(0), mint(0),mint(0)});seg.apply(0, len(key),{mint(0), mint(1), mint(0), mint(1), mint(1), mint(0), mint(1),mint(0)});};dfs(dfs, 0, -1);auto X = keys[0];auto ys = dps[0].get_all();vc<mint> Y(len(ys));FOR(i, len(ys)) Y[i] = get<0>(Mono::eval(ys[i]));mint ANS = 0;mint py = 0;FOR(i, len(X)) {ANS += mint(X[i]) * (Y[i] - py);py = Y[i];}ANS *= mint(2).pow(N - 2);print(ANS);}signed main() {cout << fixed << setprecision(15);ll T = 1;// LL(T);FOR(T) solve();return 0;}