test/library_checker/data_structure/point_set_range_composite.test.cpp

View this file on GitHub
Last update: 2022-07-19 22:43:05+09:00
Problem: https://judge.yosupo.jp/problem/point_set_range_composite

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite"
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
#include "../../../data_structure/sequence/segment_tree.hpp"
#include "../../../other/monoids/linear.hpp"
int main(){
  int N, Q;
  cin >> N >> Q;
  vector<linear> f(N);
  for (int i = 0; i < N; i++){
    cin >> f[i].a >> f[i].b;
  }
  segment_tree<linear> ST(f, composite, linear());
  for (int i = 0; i < Q; i++){
    int t;
    cin >> t;
    if (t == 0){
      int p, c, d;
      cin >> p >> c >> d;
      ST.update(p, linear(c, d));
    }
    if (t == 1){
      int l, r, x;
      cin >> l >> r >> x;
      cout << value(ST.query(l, r), x) << endl;
    }
  }
}

#line 1 "test/library_checker/data_structure/point_set_range_composite.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite"
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
#line 2 "data_structure/sequence/segment_tree.hpp"
/**
 * @brief セグメント木 (うし木)
*/
template <typename T>
struct segment_tree{
  int N;
  vector<T> ST;
  function<T(T, T)> f;
  T E;
  segment_tree(){
  }
  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);
  }
  segment_tree(vector<T> A, function<T(T, T)> f, T E): f(f), E(E){
    int n = A.size();
    N = 1;
    while (N < n){
      N *= 2;
    }
    ST = vector<T>(N * 2 - 1, E);
    for (int i = 0; i < n; i++){
      ST[N - 1 + i] = A[i];
    }
    for (int i = N - 2; i >= 0; i--){
      ST[i] = f(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
  }
  T operator [](int k){
    return ST[N - 1 + k];
  }
  void update(int k, T x){
    k += N - 1;
    ST[k] = x;
    while (k > 0){
      k = (k - 1) / 2;
      ST[k] = f(ST[k * 2 + 1], ST[k * 2 + 2]);
    }
  }
  T query(int L, int R, int i, int l, int r){
    if (r <= L || R <= l){
      return E;
    } else if (L <= l && r <= R){
      return ST[i];
    } else {
      int m = (l + r) / 2;
      return f(query(L, R, i * 2 + 1, l, m), query(L, R, i * 2 + 2, m, r));
    }
  }
  T query(int L, int R){
    return query(L, R, 0, 0, N);
  }
  T all(){
    return ST[0];
  }
};
#line 2 "other/monoids/linear.hpp"
struct linear{
  long long a, b;
  linear(){
    a = 1;
    b = 0;
  }
  linear(int a, int b): a(a), b(b){
  }
};
linear composite(linear A, linear B){
  return linear(A.a * B.a % MOD, (A.b * B.a + B.b) % MOD);
}
int value(linear A, int x){
  return (A.a * x + A.b) % MOD;
}
#line 7 "test/library_checker/data_structure/point_set_range_composite.test.cpp"
int main(){
  int N, Q;
  cin >> N >> Q;
  vector<linear> f(N);
  for (int i = 0; i < N; i++){
    cin >> f[i].a >> f[i].b;
  }
  segment_tree<linear> ST(f, composite, linear());
  for (int i = 0; i < Q; i++){
    int t;
    cin >> t;
    if (t == 0){
      int p, c, d;
      cin >> p >> c >> d;
      ST.update(p, linear(c, d));
    }
    if (t == 1){
      int l, r, x;
      cin >> l >> r >> x;
      cout << value(ST.query(l, r), x) << endl;
    }
  }
}