tests/Point_Set_Range_Composite.test.cpp

• View this file on GitHub
• Last update: 2025-11-28 02:09:51+07:00
• Problem: https://judge.yosupo.jp/problem/point_set_range_composite

Depends on

• ds/SegTree.h
• math/Affine.h
• math/ModInt.h
• misc/macros.h

Code

#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite"

#include "../misc/macros.h"
#include "../math/Affine.h"
#include "../math/ModInt.h"
#include "../ds/SegTree.h"

using Fp = modint<998244353>;
using A = affine<Fp>;

void solve() {
  int n, q;
  cin >> n >> q;
  SegTree st(n, [&](const A& l, const A& r) { return l * r; }, A{});
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    st.apply(i, {a, b});
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int p, c, d;
      cin >> p >> c >> d;
      st.apply(p, {c, d});
    } else {
      int l, r, x;
      cin >> l >> r >> x;
      auto fc = st.query(l, r);
      cout << fc(x) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}

#line 1 "tests/Point_Set_Range_Composite.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite"

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/
#line 1 "math/Affine.h"
template <class T>
struct affine {
  T a, b;
  constexpr affine() : a(1), b(0) {}
  constexpr affine(T a, T b) : a(a), b(b) {}
  T operator()(T x) const { return a * x + b; }
  affine operator()(const affine& f) const {
    return f * (*this);
  }
  affine operator*(const affine& g) const {  // g(f(x))
    return {a * g.a, b * g.a + g.b};
  }
  affine operator!=(const affine& g) const {
    return a != g.a || b != g.b;
  }
};
#line 2 "math/ModInt.h"

template <int mod>
struct modint {
  using M = modint;
  static_assert(mod > 0 && mod <= 2147483647);
  static constexpr int modulo = mod;
  static constexpr u32 r1 = []() {
    u32 r1 = mod;
    for (int i = 0; i < 5; ++i) r1 *= 2 - mod * r1;
    return -r1;
  }();
  static constexpr u32 r2 = -u64(mod) % mod;
  static u32 reduce(u64 x) {
    u32 y = u32(x) * r1, r = (x + u64(y) * mod) >> 32;
    return r >= mod ? r - mod : r;
  }
  u32 x;
  modint() : x(0) {}
  modint(i64 x) : x(reduce(u64(x % mod + mod) * r2)) {}
  M& operator+=(const M& a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  M& operator-=(const M& a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  M& operator*=(const M& a) {
    x = reduce(u64(x) * a.x);
    return *this;
  }
  M& operator/=(const M& a) { return *this *= a.inv(); }
  M operator-() const { return M(0) - *this; }
  M operator+(const M& a) const { return M(*this) += a; }
  M operator-(const M& a) const { return M(*this) -= a; }
  M operator*(const M& a) const { return M(*this) *= a; }
  M operator/(const M& a) const { return M(*this) /= a; }
  bool operator==(const M& a) const { return x == a.x; }
  bool operator!=(const M& a) const { return x != a.x; }
  M pow(u64 k) const {
    M res(1), b = *this;
    while (k) {
      if (k & 1) res *= b;
      b *= b, k >>= 1;
    }
    return res;
  }
  M inv() const { return pow(mod - 2); }
  friend ostream& operator<<(ostream& os, const M& a) {
    return os << reduce(a.x);
  }
  friend istream& operator>>(istream& is, M& a) {
    i64 v;
    is >> v;
    a = M(v);
    return is;
  }
};

u64 modmul(u64 x, u64 y, u64 m) { return u128(x) * y % m; }
u64 modpow(u64 x, u64 k, u64 m) {
  u64 res = 1;
  while (k) {
    if (k & 1) res = modmul(res, x, m);
    x = modmul(x, x, m);
    k >>= 1;
  }
  return res;
}
#line 1 "ds/SegTree.h"
// 0-indexed
template <class T, class F>
struct SegTree {
  int n, size;  // smallest size = 2^k >= n
  vector<T> seg;
  const F f;
  const T I;
  SegTree(int n, F f, const T& I) : n(n), f(f), I(I) {
    size = 1;
    while (size < n) size <<= 1;
    seg.assign(size << 1, I);
  }
  T& operator[](int k) { return seg[k + size]; }
  void set(int k, T x) { seg[k + size] = x; }  // to build
  void build() {
    for (int i = size - 1; i > 0; --i) seg[i] = f(seg[i << 1], seg[i << 1 | 1]);
  }
  void apply(int k, T x) {
    k += size, seg[k] = x;
    while (k >>= 1) seg[k] = f(seg[k << 1], seg[k << 1 | 1]);
  }
  // query [l, r)
  T query(int l, int r) {
    T L = I, R = I;
    for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
      if (l & 1) L = f(L, seg[l++]);
      if (r & 1) R = f(seg[--r], R);
    }
    return f(L, R);
  }
  template <class C>
  int max_right(int l, C check) {
    assert(0 <= l && l <= n && check(I) == true);
    if (l == n) return n;
    l += size;
    T sm = I;
    do {
      while (l % 2 == 0) l >>= 1;
      if (!check(f(sm, seg[l]))) {
        while (l < size) {
          l = l << 1;
          if (check(f(sm, seg[l]))) sm = f(sm, seg[l]), l++;
        }
        return l - size;
      }
      sm = f(sm, seg[l]), l++;
    } while ((l & -l) != l);
    return n;
  }
  template <class C>
  int min_left(int r, C check) {
    assert(0 <= r && r <= n && check(I) == true);
    if (r == 0) return 0;
    r += size;
    T sm = I;
    do {
      r--;
      while (r > 1 && (r % 2)) r >>= 1;
      if (!check(f(seg[r], sm))) {
        while (r < size) {
          r = r << 1 | 1;
          if (check(f(seg[r], sm))) sm = f(seg[r], sm), r--;
        }
        return r + 1 - size;
      }
      sm = f(seg[r], sm);
    } while ((r & -r) != r);
    return 0;
  }
};
#line 7 "tests/Point_Set_Range_Composite.test.cpp"

using Fp = modint<998244353>;
using A = affine<Fp>;

void solve() {
  int n, q;
  cin >> n >> q;
  SegTree st(n, [&](const A& l, const A& r) { return l * r; }, A{});
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    st.apply(i, {a, b});
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      int p, c, d;
      cin >> p >> c >> d;
      st.apply(p, {c, d});
    } else {
      int l, r, x;
      cin >> l >> r >> x;
      auto fc = st.query(l, r);
      cout << fc(x) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}

Back to top page