結果
| 問題 | No.2115 Making Forest Easy |
| ユーザー |
 torisasami4
|
| 提出日時 | 2022-10-28 22:55:01 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 482 ms / 2,000 ms |
| コード長 | 9,269 bytes |
| コンパイル時間 | 3,559 ms |
| コンパイル使用メモリ | 251,140 KB |
| 最終ジャッジ日時 | 2025-02-08 14:54:33 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 50 |
ソースコード
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < int(n); i++)#define per(i, n) for (int i = (n)-1; 0 <= i; i--)#define rep2(i, l, r) for (int i = (l); i < int(r); i++)#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++)cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty())cout << '\n';}using ll = long long;using pii = pair<int, int>;using pll = pair<ll, ll>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <class T>using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;template <class T>using maxheap = std::priority_queue<T>;template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}// __int128_t gcd(__int128_t a, __int128_t b) {// if (a == 0)// return b;// if (b == 0)// return a;// __int128_t cnt = a % b;// while (cnt != 0) {// a = b;// b = cnt;// cnt = a % b;// }// return b;// }long long extGCD(long long a, long long b, long long &x, long long &y) {if (b == 0) {x = 1;y = 0;return a;}long long d = extGCD(b, a % b, y, x);y -= a / b * x;return d;}struct UnionFind {vector<int> data;int num;UnionFind(int sz) {data.assign(sz, -1);num = sz;}bool unite(int x, int y) {x = find(x), y = find(y);if (x == y)return (false);if (data[x] > data[y])swap(x, y);data[x] += data[y];data[y] = x;num--;return (true);}int find(int k) {if (data[k] < 0)return (k);return (data[k] = find(data[k]));}int size(int k) {return (-data[find(k)]);}bool same(int x, int y) {return find(x) == find(y);}int operator[](int k) {return find(k);}};template <int mod>struct Mod_Int {int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}static int get_mod() {return mod;}Mod_Int &operator+=(const Mod_Int &p) {if ((x += p.x) >= mod)x -= mod;return *this;}Mod_Int &operator-=(const Mod_Int &p) {if ((x += mod - p.x) >= mod)x -= mod;return *this;}Mod_Int &operator*=(const Mod_Int &p) {x = (int)(1LL * x * p.x % mod);return *this;}Mod_Int &operator/=(const Mod_Int &p) {*this *= p.inverse();return *this;}Mod_Int &operator++() {return *this += Mod_Int(1);}Mod_Int operator++(int) {Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator--() {return *this -= Mod_Int(1);}Mod_Int operator--(int) {Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator-() const {return Mod_Int(-x);}Mod_Int operator+(const Mod_Int &p) const {return Mod_Int(*this) += p;}Mod_Int operator-(const Mod_Int &p) const {return Mod_Int(*this) -= p;}Mod_Int operator*(const Mod_Int &p) const {return Mod_Int(*this) *= p;}Mod_Int operator/(const Mod_Int &p) const {return Mod_Int(*this) /= p;}bool operator==(const Mod_Int &p) const {return x == p.x;}bool operator!=(const Mod_Int &p) const {return x != p.x;}Mod_Int inverse() const {assert(*this != Mod_Int(0));return pow(mod - 2);}Mod_Int pow(long long k) const {Mod_Int now = *this, ret = 1;for (; k > 0; k >>= 1, now *= now) {if (k & 1)ret *= now;}return ret;}friend ostream &operator<<(ostream &os, const Mod_Int &p) {return os << p.x;}friend istream &operator>>(istream &is, Mod_Int &p) {long long a;is >> a;p = Mod_Int<mod>(a);return is;}};ll mpow2(ll x, ll n, ll mod) {ll ans = 1;x %= mod;while (n != 0) {if (n & 1)ans = ans * x % mod;x = x * x % mod;n = n >> 1;}ans %= mod;return ans;}ll modinv2(ll a, ll mod) {ll b = mod, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= mod;if (u < 0)u += mod;return u;}ll divide_int(ll a, ll b) {if (b < 0)a = -a, b = -b;return (a >= 0 ? a / b : (a - b + 1) / b);}// const int MOD = 1000000007;const int MOD = 998244353;using mint = Mod_Int<MOD>;mint mpow(mint x, ll n) {bool rev = n < 0;n = abs(n);mint ans = 1;while (n != 0) {if (n & 1)ans *= x;x *= x;n = n >> 1;}return (rev ? ans.inverse() : ans);}// ----- library -------// S:吸い上げ前, T:吸い上げ後template <typename Data, typename S, typename T>struct ReRooting {struct Node {int to, rev;};using F1 = function<S(S, T)>;using F2 = function<T(S, Data)>;vector<Data> data;vector<vector<Node>> g;vector<vector<S>> ldp, rdp;vector<int> lptr, rptr;const F1 f1;const F2 f2;const S ident;vector<unordered_map<int, int>> id;ReRooting(vector<Data> v, const F1 &f1, const F2 &f2, const S &ident) : data(v), g(v.size()), ldp(v.size()), rdp(v.size()), lptr(v.size()), rptr(v.size()), id(v.size()), f1(f1), f2(f2), ident(ident) {}void add_edge(int u, int v) {id[u][v] = g[u].size();id[v][u] = g[v].size();g[u].emplace_back((Node){v, (int)g[v].size()});g[v].emplace_back((Node){u, (int)g[u].size() - 1});}S dfs(int idx, int par) {while (lptr[idx] != par && lptr[idx] < g[idx].size()) {auto &e = g[idx][lptr[idx]];ldp[idx][lptr[idx] + 1] = f1(ldp[idx][lptr[idx]], f2(dfs(e.to, e.rev), data[e.to]));++lptr[idx];}while (rptr[idx] != par && rptr[idx] >= 0) {auto &e = g[idx][rptr[idx]];rdp[idx][rptr[idx]] = f1(rdp[idx][rptr[idx] + 1], f2(dfs(e.to, e.rev), data[e.to]));--rptr[idx];}if (par < 0)return rdp[idx][0];return f1(ldp[idx][par], rdp[idx][par + 1]);}vector<T> solve() {for (int i = 0; i < g.size(); i++) {ldp[i].assign(g[i].size() + 1, ident);rdp[i].assign(g[i].size() + 1, ident);lptr[i] = 0;rptr[i] = (int)g[i].size() - 1;}vector<T> ret;for (int i = 0; i < g.size(); i++) {ret.push_back(f2(dfs(i, -1), data[i]));}return ret;}vector<S> solve2() {for (int i = 0; i < g.size(); i++) {ldp[i].assign(g[i].size() + 1, ident);rdp[i].assign(g[i].size() + 1, ident);lptr[i] = 0;rptr[i] = (int)g[i].size() - 1;}vector<S> ret;for (int i = 0; i < g.size(); i++) {ret.push_back(dfs(i, -1));}return ret;}T query(int idx, int par) {return f2(dfs(idx, id[idx][par]), data[idx]);}S query2(int idx, int par) {return dfs(idx, id[idx][par]);}};using T = pair<vector<mint>, int>;T f1(const T &a, const T &b) {vector<mint> sa = a.first, sb = b.first;rep(i, 1000) sa[i + 1] += sa[i], sb[i + 1] += sb[i];vector<mint> ret(1001);ret[0] = sa[0] * sb[0];rep(i, 1000) ret[i + 1] = sa[i + 1] * sb[i + 1] - sa[i] * sb[i];return {ret, a.second + b.second};}T f2(const T &a, const int &na) {auto ret = a.first;rep(i, na) ret[na] += ret[i], ret[i] = 0;ret[0] = mpow(2, a.second);return {ret, a.second + 1};}// ----- library -------int main() {ios::sync_with_stdio(false);std::cin.tie(nullptr);cout << fixed << setprecision(15);int n;cin >> n;vector<int> a(n);rep(i, n) cin >> a[i];vector<mint> t0(1001, 0);t0[0] = 1;ReRooting<int, T, T> g(a, f1, f2, {t0, 0});int u, v;rep(i, n - 1) cin >> u >> v, g.add_edge(--u, --v);auto ret = g.solve();mint ans = 0;rep(i, n) rep(j, 1001) ans += ret[i].first[j] * j;cout << ans << endl;}