test/verify/yosupo-point-set-range-composite-3.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 14:25:42+00:00
• Problem: https://judge.yosupo.jp/problem/point_set_range_composite

Depends on

• Montgomery Mod Int (math/combinatorics/montgomery-mod-int.hpp)
• structure/class/affine.hpp
• structure/class/monoid.hpp
• structure/class/point-set-range-composite.hpp
• Segment Tree (セグメント木) (structure/segment-tree/segment-tree.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_set_range_composite
// clang-format on

#include <iostream>
#include <vector>

#include "../../math/combinatorics/montgomery-mod-int.hpp"
#include "../../structure/class/point-set-range-composite.hpp"
#include "../../structure/segment-tree/segment-tree.hpp"

using namespace std;

using mint = modint998244353;

int main() {
  int N, Q;
  cin >> N >> Q;
  vector<Affine<mint> > data(N);
  for (auto& d : data) {
    mint x, y;
    cin >> x >> y;
    d = {x, y};
  }
  auto seg = SegmentTree(PointSetRangeComposite<mint>(), data);
  for (int i = 0; i < Q; i++) {
    int t;
    cin >> t;
    if (t == 0) {
      int p;
      mint a, b;
      cin >> p >> a >> b;
      seg.set(p, {a, b});
    } else {
      int l, r;
      mint x;
      cin >> l >> r >> x;
      cout << seg.prod(l, r).eval(x) << "\n";
    }
  }
}

#line 1 "test/verify/yosupo-point-set-range-composite-3.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_set_range_composite
// clang-format on

#include <iostream>
#include <vector>

#line 2 "math/combinatorics/montgomery-mod-int.hpp"

#include <cstdint>
#line 5 "math/combinatorics/montgomery-mod-int.hpp"

template <std::uint32_t mod_, bool fast = false>
struct MontgomeryModInt {
 private:
  using mint = MontgomeryModInt;
  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;

  static constexpr u32 get_r() {
    u32 ret = mod_;
    for (i32 i = 0; i < 4; i++) ret *= 2 - mod_ * ret;
    return ret;
  }

  static constexpr u32 r = get_r();

  static constexpr u32 n2 = -u64(mod_) % mod_;

  static_assert(r * mod_ == 1, "invalid, r * mod != 1");
  static_assert(mod_ < (1 << 30), "invalid, mod >= 2 ^ 30");
  static_assert((mod_ & 1) == 1, "invalid, mod % 2 == 0");

  u32 x;

 public:
  MontgomeryModInt() : x{} {}

  MontgomeryModInt(const i64& a)
      : x(reduce(u64(fast ? a : (a % mod() + mod())) * n2)) {}

  static constexpr u32 reduce(const u64& b) {
    return u32(b >> 32) + mod() - u32((u64(u32(b) * r) * mod()) >> 32);
  }

  mint& operator+=(const mint& p) {
    if (i32(x += p.x - 2 * mod()) < 0) x += 2 * mod();
    return *this;
  }

  mint& operator-=(const mint& p) {
    if (i32(x -= p.x) < 0) x += 2 * mod();
    return *this;
  }

  mint& operator*=(const mint& p) {
    x = reduce(u64(x) * p.x);
    return *this;
  }

  mint& operator/=(const mint& p) {
    *this *= p.inv();
    return *this;
  }

  mint operator-() const { return mint() - *this; }

  mint operator+(const mint& p) const { return mint(*this) += p; }

  mint operator-(const mint& p) const { return mint(*this) -= p; }

  mint operator*(const mint& p) const { return mint(*this) *= p; }

  mint operator/(const mint& p) const { return mint(*this) /= p; }

  bool operator==(const mint& p) const {
    return (x >= mod() ? x - mod() : x) == (p.x >= mod() ? p.x - mod() : p.x);
  }

  bool operator!=(const mint& p) const {
    return (x >= mod() ? x - mod() : x) != (p.x >= mod() ? p.x - mod() : p.x);
  }

  u32 val() const {
    u32 ret = reduce(x);
    return ret >= mod() ? ret - mod() : ret;
  }

  mint pow(u64 n) const {
    mint ret(1), mul(*this);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  mint inv() const { return pow(mod() - 2); }

  friend std::ostream& operator<<(std::ostream& os, const mint& p) {
    return os << p.val();
  }

  friend std::istream& operator>>(std::istream& is, mint& a) {
    i64 t;
    is >> t;
    a = mint(t);
    return is;
  }

  static constexpr u32 mod() { return mod_; }
};

template <std::uint32_t mod>
using modint = MontgomeryModInt<mod>;
using modint998244353 = modint<998244353>;
using modint1000000007 = modint<1000000007>;
#line 2 "structure/class/point-set-range-composite.hpp"

#line 2 "structure/class/affine.hpp"

template <typename T>
struct Affine {
  T a, b;  // ax+b
  Affine() : a(1), b(0) {}
  Affine(T a, T b) : a(a), b(b) {}
  T eval(T x) const { return a * x + b; }
  static constexpr Affine op(const Affine& l, const Affine& r) {
    return {l.a * r.a, l.b * r.a + r.b};
  }
  constexpr bool operator==(const Affine& p) const {
    return a == p.a and b == p.b;
  }
  constexpr bool operator!=(const Affine& p) const {
    return a != p.a or b != p.b;
  }
};
#line 4 "structure/class/point-set-range-composite.hpp"

template <typename T>
struct PointSetRangeComposite {
  using S = Affine<T>;
  static constexpr S op(const S& a, const S& b) { return S::op(a, b); }
  static constexpr S e() { return S(); }
};
#line 2 "structure/segment-tree/segment-tree.hpp"

#include <cassert>
#include <optional>
#line 6 "structure/segment-tree/segment-tree.hpp"

#line 2 "structure/class/monoid.hpp"

template <typename S2, typename Op, typename E>
struct LambdaMonoid {
  using S = S2;
  S op(const S& a, const S& b) const { return _op(a, b); }

  S e() const { return _e(); }

  LambdaMonoid(Op _op, E _e) : _op(_op), _e(_e) {}

 private:
  Op _op;

  E _e;
};

template <typename Op, typename E>
LambdaMonoid(Op _op, E _e) -> LambdaMonoid<decltype(_e()), Op, E>;

/*
struct Monoid {
  using S = ?;
  static constexpr S op(const S& a, const S& b) {}
  static constexpr S e() {}
};
*/
#line 8 "structure/segment-tree/segment-tree.hpp"

template <typename Monoid>
struct SegmentTree {
  using S = typename Monoid::S;

 private:
  int n, sz;

  std::vector<S> seg;

  Monoid m;

 public:
  SegmentTree() = default;

  explicit SegmentTree(Monoid m, int n) : m(m), n(n) {
    sz = 1;
    while (sz < n) sz <<= 1;
    seg.assign(2 * sz, m.e());
  }

  explicit SegmentTree(Monoid m, const std::vector<S>& v)
      : SegmentTree(m, (int)v.size()) {
    build(v);
  }

  void build(const std::vector<S>& v) {
    assert(n == (int)v.size());
    for (int k = 0; k < n; k++) seg[k + sz] = v[k];
    for (int k = sz - 1; k > 0; k--) {
      seg[k] = m.op(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void set(int k, const S& x) {
    k += sz;
    seg[k] = x;
    while (k >>= 1) {
      seg[k] = m.op(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  S get(int k) const { return seg[k + sz]; }

  S operator[](int k) const { return get(k); }

  void apply(int k, const S& x) {
    k += sz;
    seg[k] = m.op(seg[k], x);
    while (k >>= 1) {
      seg[k] = m.op(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  S prod(int l, int r) const {
    if (l >= r) return m.e();
    S L = m.e(), R = m.e();
    for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
      if (l & 1) L = m.op(L, seg[l++]);
      if (r & 1) R = m.op(seg[--r], R);
    }
    return m.op(L, R);
  }

  S all_prod() const { return seg[1]; }

  template <typename C>
  std::optional<int> find_first(int l, const C& check) const {
    if (l >= n) return std::nullopt;
    l += sz;
    S sum = m.e();
    do {
      while ((l & 1) == 0) l >>= 1;
      if (check(m.op(sum, seg[l]))) {
        while (l < sz) {
          l <<= 1;
          auto nxt = m.op(sum, seg[l]);
          if (not check(nxt)) {
            sum = nxt;
            l++;
          }
        }
        return l + 1 - sz;
      }
      sum = m.op(sum, seg[l++]);
    } while ((l & -l) != l);
    return std::nullopt;
  }

  template <typename C>
  std::optional<int> find_last(int r, const C& check) const {
    if (r <= 0) return std::nullopt;
    r += sz;
    S sum = m.e();
    do {
      r--;
      while (r > 1 and (r & 1)) r >>= 1;
      if (check(m.op(seg[r], sum))) {
        while (r < sz) {
          r = (r << 1) + 1;
          auto nxt = m.op(seg[r], sum);
          if (not check(nxt)) {
            sum = nxt;
            r--;
          }
        }
        return r - sz;
      }
      sum = m.op(seg[r], sum);
    } while ((r & -r) != r);
    return std::nullopt;
  }
};
#line 11 "test/verify/yosupo-point-set-range-composite-3.test.cpp"

using namespace std;

using mint = modint998244353;

int main() {
  int N, Q;
  cin >> N >> Q;
  vector<Affine<mint> > data(N);
  for (auto& d : data) {
    mint x, y;
    cin >> x >> y;
    d = {x, y};
  }
  auto seg = SegmentTree(PointSetRangeComposite<mint>(), data);
  for (int i = 0; i < Q; i++) {
    int t;
    cin >> t;
    if (t == 0) {
      int p;
      mint a, b;
      cin >> p >> a >> b;
      seg.set(p, {a, b});
    } else {
      int l, r;
      mint x;
      cin >> l >> r >> x;
      cout << seg.prod(l, r).eval(x) << "\n";
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	3 ms	3 MB
g++	max_random_00	AC	1671 ms	15 MB
g++	max_random_01	AC	1291 ms	15 MB
g++	max_random_02	AC	1062 ms	15 MB
g++	max_random_03	AC	1045 ms	15 MB
g++	max_random_04	AC	1029 ms	15 MB
g++	random_00	AC	1037 ms	14 MB
g++	random_01	AC	922 ms	15 MB
g++	random_02	AC	580 ms	5 MB
g++	random_03	AC	276 ms	15 MB
g++	random_04	AC	299 ms	14 MB
g++	small_00	AC	4 ms	4 MB
g++	small_01	AC	3 ms	3 MB
g++	small_02	AC	4 ms	4 MB
g++	small_03	AC	3 ms	4 MB
g++	small_04	AC	4 ms	4 MB
clang++	example_00	AC	3 ms	4 MB
clang++	max_random_00	AC	1614 ms	15 MB
clang++	max_random_01	AC	1109 ms	15 MB
clang++	max_random_02	AC	1398 ms	15 MB
clang++	max_random_03	AC	1109 ms	15 MB
clang++	max_random_04	AC	1239 ms	15 MB
clang++	random_00	AC	1089 ms	14 MB
clang++	random_01	AC	951 ms	15 MB
clang++	random_02	AC	699 ms	5 MB
clang++	random_03	AC	279 ms	15 MB
clang++	random_04	AC	336 ms	14 MB
clang++	small_00	AC	4 ms	4 MB
clang++	small_01	AC	4 ms	4 MB
clang++	small_02	AC	3 ms	4 MB
clang++	small_03	AC	4 ms	4 MB
clang++	small_04	AC	5 ms	4 MB

Back to top page