結果

問題 No.2340 Triple Tree Query (Easy)
ユーザー SSRSSSRS
提出日時 2023-05-27 04:28:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 491 ms / 5,000 ms
コード長 3,041 bytes
最終ジャッジ日時 2023-08-28 00:41:54
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

ソースコード

diff # 

#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> pos(N);
  pos[0] = 0;
  int t = 1;
  vector<int> in(N), out(N), mn(N), mx(N);
  auto dfs = [&](auto dfs, int v = 0) -> void {
    in[v] = t;
    mn[v] = t;
    for (int w : c[v]){
      pos[w] = t;
      t++;
    }
    mx[v] = t;
    for (int w : c[v]){
      dfs(dfs, w);
    }
    out[v] = t;
  };
  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[pos[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(pos[p[V]], pos[p[V]] + 1, affine(C, D));
      }
      ST.range_apply(pos[V], pos[V] + 1, affine(C, D));
      ST.range_apply(mn[V], mx[V], affine(C, D));
    }
    if (T == 3){
      int V;
      long long C, D;
      cin >> V >> C >> D;
      V--;
      ST.range_apply(pos[V], pos[V] + 1, affine(C, D));
      ST.range_apply(in[V], out[V], affine(C, D));
    }
  }
}
0