結果
| 問題 | No.2949 Product on Tree |
| ユーザー |
 apricity
|
| 提出日時 | 2024-10-26 03:09:51 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 449 ms / 2,000 ms |
| コード長 | 7,260 bytes |
| コンパイル時間 | 2,709 ms |
| コンパイル使用メモリ | 130,300 KB |
| 最終ジャッジ日時 | 2025-02-25 00:09:59 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 46 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<cctype>#include<chrono>#include<random>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep1(a) for(int i = 0; i < a; i++)#define rep2(i, a) for(int i = 0; i < a; i++)#define rep3(i, a, b) for(int i = a; i < b; i++)#define rep4(i, a, b, c) for(int i = a; i < b; i += c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(a) for(int i = (a)-1; i >= 0; i--)#define rrep2(i, a) for(int i = (a)-1; i >= 0; i--)#define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--)#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;using vi = vector<int>;using vl = 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>>;#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__))))template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}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...);}template<int mod> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % mod) {if (val < 0) val += mod;}constexpr int getmod() { return mod; }constexpr Fp operator - () const noexcept {return val ? mod - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= mod) val -= mod;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += mod;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % mod;return *this;}constexpr Fp inv() const noexcept {long long a = val, b = mod, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}assert(a == 1);return u;}constexpr Fp& operator /= (const Fp& r) noexcept {return *this *= r.inv();}constexpr Fp pow(long long n) const noexcept {assert(0 <= n);Fp x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream &is, Fp<mod>& x) noexcept {int val; is >> val;x = Fp<mod>(val);return is;}friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept {return os << x.val;}};//const int mod = 1e9+7;const int mod = 998244353;using mint = Fp<mod>;const int MAX_N = 200005;vector<int> g[MAX_N];mint a[MAX_N];struct var {mint s;var(mint s_ = 0): s(s_) {}var operator+ (const var& a) const {return {s+a.s};}var addRoot(int u) const {return {(s+1)*a[u]};}};vector<var> dp[MAX_N];var ans[MAX_N];var dfs1(int v, int p = -1) {var dpsum;dp[v] = vector<var> (g[v].size());rep(i, g[v].size()) {int u = g[v][i];if(u == p) continue;dp[v][i] = dfs1(u, v);dpsum = dpsum + dp[v][i];}return dpsum.addRoot(v);}void dfs2(int v, const var& dpParent = var(), int p = -1) {int deg = g[v].size();rep(i, deg) if(g[v][i] == p) dp[v][i] = dpParent;vector<var> dpSum_Left(deg+1), dpSum_Right(deg+1);rep(i,deg) dpSum_Left[i+1] = dpSum_Left[i] + dp[v][i];rrep(i, deg) dpSum_Right[i] = dpSum_Right[i+1] + dp[v][i];ans[v] = dpSum_Left[deg].addRoot(v);rep(i,deg) {int u = g[v][i];if(u == p) continue;var d = dpSum_Left[i] + dpSum_Right[i+1];dfs2(u, d.addRoot(v), v);}}int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int n; in(n);rep(i,n) in(a[i]);rep(i,n-1){int u,v; in(u,v); u--; v--;g[u].pb(v);g[v].pb(u);}dfs1(0); dfs2(0);mint res = 0;rep(i,n) res += ans[i].s;rep(i,n) res -= a[i];out(res/2);}