結果
問題 | No.2340 Triple Tree Query (Easy) |
ユーザー |
![]() |
提出日時 | 2023-05-27 04:12:52 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 873 ms / 5,000 ms |
コード長 | 3,649 bytes |
コンパイル時間 | 3,255 ms |
コンパイル使用メモリ | 182,308 KB |
実行使用メモリ | 29,796 KB |
最終ジャッジ日時 | 2024-12-28 12:01:44 |
合計ジャッジ時間 | 20,623 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;const long long MOD = 998244353;struct affine{long long a, b;affine(){a = 1;b = 0;}affine(int a, int b): a(a), b(b){}};affine composite(affine A, affine B){return affine(A.a * B.a % MOD, (A.b * B.a + B.b) % MOD);}int value(affine A, int x){return (A.a * x + A.b) % MOD;}template <typename T>struct dual_segment_tree{int N;vector<T> ST;function<T(T, T)> f;T E;dual_segment_tree(int n, function<T(T, T)> f, T E): f(f), E(E){N = 1;while (N < n){N *= 2;}ST = vector<T>(N * 2 - 1, E);}void push(int i){if (i < N - 1){ST[i * 2 + 1] = f(ST[i * 2 + 1], ST[i]);ST[i * 2 + 2] = f(ST[i * 2 + 2], ST[i]);ST[i] = E;}}T operator [](int k){int v = 0;for (int i = N / 2; i >= 1; i >>= 1){push(v);if ((k & i) == 0){v = v * 2 + 1;} else {v = v * 2 + 2;}}return ST[v];}void range_apply(int L, int R, T x, int i, int l, int r){if (r <= L || R <= l){} else if (L <= l && r <= R){ST[i] = f(ST[i], x);} else {push(i);int m = (l + r) / 2;range_apply(L, R, x, i * 2 + 1, l, m);range_apply(L, R, x, i * 2 + 2, m, r);}}void range_apply(int L, int R, T x){range_apply(L, R, x, 0, 0, N);}};int main(){int N, Q;cin >> N >> Q;vector<vector<int>> E(N);for (int i = 0; i < N - 1; i++){int A, B;cin >> A >> B;A--;B--;E[A].push_back(B);E[B].push_back(A);}vector<int> X(N);for (int i = 0; i < N; i++){cin >> X[i];}vector<int> p(N, -1);vector<vector<int>> c(N);vector<int> b;queue<int> q;q.push(0);while (!q.empty()){int v = q.front();q.pop();b.push_back(v);for (int w : E[v]){if (w != p[v]){p[w] = v;c[v].push_back(w);q.push(w);}}}reverse(b.begin(), b.end());vector<int> sz(N, 1);for (int v : b){for (int &w : c[v]){sz[v] += sz[w];if (sz[w] > sz[c[v][0]]){swap(w, c[v][0]);}}}vector<int> in(N);in[0] = 0;int t = 1;vector<int> next(N);for (int i = 0; i < N; i++){next[i] = i;}auto dfs = [&](auto dfs, int v = 0) -> void {if (v != 0){if (in[p[v]] == in[v] - 1){next[v] = next[p[v]];}}if (!c[v].empty()){in[c[v][0]] = t;t++;dfs(dfs, c[v][0]);int cnt = c[v].size();for (int i = 1; i < cnt; i++){in[c[v][i]] = t;t++;}for (int i = 1; i < cnt; i++){dfs(dfs, c[v][i]);}}};dfs(dfs);dual_segment_tree<affine> ST(N, composite, affine());for (int i = 0; i < Q; i++){int T;cin >> T;if (T == 1){int V;cin >> V;V--;cout << value(ST[in[V]], X[V]) << endl;}if (T == 2){int V, K;long long C, D;cin >> V >> K >> C >> D;V--;if (V != 0){ST.range_apply(in[p[V]], in[p[V]] + 1, affine(C, D));}ST.range_apply(in[V], in[V] + 1, affine(C, D));if (!c[V].empty()){ST.range_apply(in[c[V][0]], in[c[V][0]] + 1, affine(C, D));}if (c[V].size() >= 2){ST.range_apply(in[c[V][1]], in[c[V].back()] + 1, affine(C, D));}}if (T == 3){int V;long long C, D;cin >> V >> C >> D;V--;ST.range_apply(in[V], in[V] + 1, affine(C, D));if (!c[V].empty()){ST.range_apply(in[c[V][0]], in[c[V][0]] + sz[V] - 1, affine(C, D));}}}}