C++ Library for Competitive Programming
/*
* @title データ構造/遅延伝播セグメント木
*
* verification-helper: PROBLEM https://judge.yosupo.jp/problem/range_affine_range_sum
*/
#include <iostream>
#include <utility>
#include <vector>
#include "emthrm/data_structure/lazy_segment_tree.hpp"
#include "emthrm/math/modint.hpp"
int main() {
using ModInt = emthrm::MInt<998244353>;
int n, q;
std::cin >> n >> q;
struct M {
using Monoid = std::pair<ModInt, int>;
using OperatorMonoid = std::pair<ModInt, ModInt>;
static constexpr Monoid m_id() { return {0, 0}; }
static constexpr OperatorMonoid o_id() { return {1, 0}; }
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return {a.first + b.first, a.second + b.second};
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return {b.first * a.first, b.first * a.second + b.second};
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return {a.first * b.first + b.second * a.second, a.second};
}
};
std::vector<M::Monoid> a(n, {0, 1});
for (int i = 0; i < n; ++i) {
std::cin >> a[i].first;
}
emthrm::LazySegmentTree<M> seg(a);
while (q--) {
int query, l, r;
std::cin >> query >> l >> r;
if (query == 0) {
int b, c;
std::cin >> b >> c;
seg.apply(l, r, {b, c});
} else if (query == 1) {
std::cout << seg.get(l, r).first << '\n';
}
}
return 0;
}
#line 1 "test/data_structure/lazy_segment_tree.test.cpp"
/*
* @title データ構造/遅延伝播セグメント木
*
* verification-helper: PROBLEM https://judge.yosupo.jp/problem/range_affine_range_sum
*/
#include <iostream>
#include <utility>
#include <vector>
#line 1 "include/emthrm/data_structure/lazy_segment_tree.hpp"
#include <algorithm>
#include <bit>
// #include <cassert>
#include <limits>
#include <type_traits>
#line 10 "include/emthrm/data_structure/lazy_segment_tree.hpp"
namespace emthrm {
template <typename T>
requires requires {
typename T::Monoid;
typename T::OperatorMonoid;
{T::m_id()} -> std::same_as<typename T::Monoid>;
{T::o_id()} -> std::same_as<typename T::OperatorMonoid>;
{T::m_merge(std::declval<typename T::Monoid>(),
std::declval<typename T::Monoid>())}
-> std::same_as<typename T::Monoid>;
{T::o_merge(std::declval<typename T::OperatorMonoid>(),
std::declval<typename T::OperatorMonoid>())}
-> std::same_as<typename T::OperatorMonoid>;
{T::apply(std::declval<typename T::Monoid>(),
std::declval<typename T::OperatorMonoid>())}
-> std::same_as<typename T::Monoid>;
}
struct LazySegmentTree {
using Monoid = typename T::Monoid;
using OperatorMonoid = typename T::OperatorMonoid;
explicit LazySegmentTree(const int n)
: LazySegmentTree(std::vector<Monoid>(n, T::m_id())) {}
explicit LazySegmentTree(const std::vector<Monoid>& a)
: n(a.size()), height(std::countr_zero(std::bit_ceil(a.size()))),
p2(1 << height) {
lazy.assign(p2, T::o_id());
data.assign(p2 << 1, T::m_id());
std::copy(a.begin(), a.end(), data.begin() + p2);
for (int i = p2 - 1; i > 0; --i) {
data[i] = T::m_merge(data[i << 1], data[(i << 1) + 1]);
}
}
void set(int idx, const Monoid val) {
idx += p2;
for (int i = height; i > 0; --i) {
propagate(idx >> i);
}
data[idx] = val;
for (int i = 1; i <= height; ++i) {
const int current_idx = idx >> i;
data[current_idx] =
T::m_merge(data[current_idx << 1], data[(current_idx << 1) + 1]);
}
}
void apply(int idx, const OperatorMonoid val) {
idx += p2;
for (int i = height; i > 0; --i) {
propagate(idx >> i);
}
data[idx] = T::apply(data[idx], val);
for (int i = 1; i <= height; ++i) {
const int current_idx = idx >> i;
data[current_idx] =
T::m_merge(data[current_idx << 1], data[(current_idx << 1) + 1]);
}
}
void apply(int left, int right, const OperatorMonoid val) {
if (right <= left) [[unlikely]] return;
left += p2;
right += p2;
const int ctz_left = std::countr_zero(static_cast<unsigned int>(left));
for (int i = height; i > ctz_left; --i) {
propagate(left >> i);
}
const int ctz_right = std::countr_zero(static_cast<unsigned int>(right));
for (int i = height; i > ctz_right; --i) {
propagate(right >> i);
}
for (int l = left, r = right; l < r; l >>= 1, r >>= 1) {
if (l & 1) apply_sub(l++, val);
if (r & 1) apply_sub(--r, val);
}
for (int i = left >> (ctz_left + 1); i > 0; i >>= 1) {
data[i] = T::m_merge(data[i << 1], data[(i << 1) + 1]);
}
for (int i = right >> (ctz_right + 1); i > 0; i >>= 1) {
data[i] = T::m_merge(data[i << 1], data[(i << 1) + 1]);
}
}
Monoid get(int left, int right) {
if (right <= left) [[unlikely]] return T::m_id();
left += p2;
right += p2;
const int ctz_left = std::countr_zero(static_cast<unsigned int>(left));
for (int i = height; i > ctz_left; --i) {
propagate(left >> i);
}
const int ctz_right = std::countr_zero(static_cast<unsigned int>(right));
for (int i = height; i > ctz_right; --i) {
propagate(right >> i);
}
Monoid res_l = T::m_id(), res_r = T::m_id();
for (; left < right; left >>= 1, right >>= 1) {
if (left & 1) res_l = T::m_merge(res_l, data[left++]);
if (right & 1) res_r = T::m_merge(data[--right], res_r);
}
return T::m_merge(res_l, res_r);
}
Monoid operator[](const int idx) {
const int node = idx + p2;
for (int i = height; i > 0; --i) {
propagate(node >> i);
}
return data[node];
}
template <typename G>
int find_right(int left, const G g) {
if (left >= n) [[unlikely]] return n;
left += p2;
for (int i = height; i > 0; --i) {
propagate(left >> i);
}
Monoid val = T::m_id();
do {
while (!(left & 1)) left >>= 1;
Monoid nxt = T::m_merge(val, data[left]);
if (!g(nxt)) {
while (left < p2) {
propagate(left);
left <<= 1;
nxt = T::m_merge(val, data[left]);
if (g(nxt)) {
val = nxt;
++left;
}
}
return left - p2;
}
val = nxt;
++left;
} while (!std::has_single_bit(static_cast<unsigned int>(left)));
return n;
}
template <typename G>
int find_left(int right, const G g) {
if (right <= 0) [[unlikely]] return -1;
right += p2;
for (int i = height; i > 0; --i) {
propagate((right - 1) >> i);
}
Monoid val = T::m_id();
do {
--right;
while (right > 1 && (right & 1)) right >>= 1;
Monoid nxt = T::m_merge(data[right], val);
if (!g(nxt)) {
while (right < p2) {
propagate(right);
right = (right << 1) + 1;
nxt = T::m_merge(data[right], val);
if (g(nxt)) {
val = nxt;
--right;
}
}
return right - p2;
}
val = nxt;
} while (!std::has_single_bit(static_cast<unsigned int>(right)));
return -1;
}
private:
const int n, height, p2;
std::vector<Monoid> data;
std::vector<OperatorMonoid> lazy;
void apply_sub(const int idx, const OperatorMonoid& val) {
data[idx] = T::apply(data[idx], val);
if (idx < p2) lazy[idx] = T::o_merge(lazy[idx], val);
}
void propagate(const int idx) {
// assert(1 <= idx && idx < p2);
apply_sub(idx << 1, lazy[idx]);
apply_sub((idx << 1) + 1, lazy[idx]);
lazy[idx] = T::o_id();
}
};
namespace monoid {
template <typename T>
struct RangeMinimumAndUpdateQuery {
using Monoid = T;
using OperatorMonoid = T;
static constexpr Monoid m_id() { return std::numeric_limits<Monoid>::max(); }
static constexpr OperatorMonoid o_id() {
return std::numeric_limits<OperatorMonoid>::max();
}
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return std::min(a, b);
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return b == o_id() ? a : b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return b == o_id() ? a : b;
}
};
template <typename T>
struct RangeMaximumAndUpdateQuery {
using Monoid = T;
using OperatorMonoid = T;
static constexpr Monoid m_id() {
return std::numeric_limits<Monoid>::lowest();
}
static constexpr OperatorMonoid o_id() {
return std::numeric_limits<OperatorMonoid>::lowest();
}
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return std::max(a, b);
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return b == o_id() ? a : b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return b == o_id()? a : b;
}
};
template <typename T, T Inf>
struct RangeMinimumAndAddQuery {
using Monoid = T;
using OperatorMonoid = T;
static constexpr Monoid m_id() { return Inf; }
static constexpr OperatorMonoid o_id() { return 0; }
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return std::min(a, b);
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return a + b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return a + b;
}
};
template <typename T, T Inf>
struct RangeMaximumAndAddQuery {
using Monoid = T;
using OperatorMonoid = T;
static constexpr Monoid m_id() { return -Inf; }
static constexpr OperatorMonoid o_id() { return 0; }
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return std::max(a, b);
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return a + b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return a + b;
}
};
template <typename T>
struct RangeSumAndUpdateQuery {
using Monoid = struct { T sum; int len; };
using OperatorMonoid = T;
static std::vector<Monoid> init(const int n) {
return std::vector<Monoid>(n, Monoid{0, 1});
}
static constexpr Monoid m_id() { return {0, 0}; }
static constexpr OperatorMonoid o_id() {
return std::numeric_limits<OperatorMonoid>::max();
}
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return Monoid{a.sum + b.sum, a.len + b.len};
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return b == o_id() ? a : b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return Monoid{b == o_id() ? a.sum : b * a.len, a.len};
}
};
template <typename T>
struct RangeSumAndAddQuery {
using Monoid = struct { T sum; int len; };
using OperatorMonoid = T;
static std::vector<Monoid> init(const int n) {
return std::vector<Monoid>(n, Monoid{0, 1});
}
static constexpr Monoid m_id() { return {0, 0}; }
static constexpr OperatorMonoid o_id() { return 0; }
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return Monoid{a.sum + b.sum, a.len + b.len};
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return a + b;
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return Monoid{a.sum + b * a.len, a.len};
}
};
} // namespace monoid
} // namespace emthrm
#line 1 "include/emthrm/math/modint.hpp"
#ifndef ARBITRARY_MODINT
# include <cassert>
#endif
#include <compare>
#line 9 "include/emthrm/math/modint.hpp"
// #include <numeric>
#line 12 "include/emthrm/math/modint.hpp"
namespace emthrm {
#ifndef ARBITRARY_MODINT
template <unsigned int M>
struct MInt {
unsigned int v;
constexpr MInt() : v(0) {}
constexpr MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
static constexpr MInt raw(const int x) {
MInt x_;
x_.v = x;
return x_;
}
static constexpr int get_mod() { return M; }
static constexpr void set_mod(const int divisor) {
assert(std::cmp_equal(divisor, M));
}
static void init(const int x) {
inv<true>(x);
fact(x);
fact_inv(x);
}
template <bool MEMOIZES = false>
static MInt inv(const int n) {
// assert(0 <= n && n < M && std::gcd(n, M) == 1);
static std::vector<MInt> inverse{0, 1};
const int prev = inverse.size();
if (n < prev) return inverse[n];
if constexpr (MEMOIZES) {
// "n!" and "M" must be disjoint.
inverse.resize(n + 1);
for (int i = prev; i <= n; ++i) {
inverse[i] = -inverse[M % i] * raw(M / i);
}
return inverse[n];
}
int u = 1, v = 0;
for (unsigned int a = n, b = M; b;) {
const unsigned int q = a / b;
std::swap(a -= q * b, b);
std::swap(u -= q * v, v);
}
return u;
}
static MInt fact(const int n) {
static std::vector<MInt> factorial{1};
if (const int prev = factorial.size(); n >= prev) {
factorial.resize(n + 1);
for (int i = prev; i <= n; ++i) {
factorial[i] = factorial[i - 1] * i;
}
}
return factorial[n];
}
static MInt fact_inv(const int n) {
static std::vector<MInt> f_inv{1};
if (const int prev = f_inv.size(); n >= prev) {
f_inv.resize(n + 1);
f_inv[n] = inv(fact(n).v);
for (int i = n; i > prev; --i) {
f_inv[i - 1] = f_inv[i] * i;
}
}
return f_inv[n];
}
static MInt nCk(const int n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
fact_inv(n - k) * fact_inv(k));
}
static MInt nPk(const int n, const int k) {
return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k);
}
static MInt nHk(const int n, const int k) {
return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k));
}
static MInt large_nCk(long long n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
inv<true>(k);
MInt res = 1;
for (int i = 1; i <= k; ++i) {
res *= inv(i) * n--;
}
return res;
}
constexpr MInt pow(long long exponent) const {
MInt res = 1, tmp = *this;
for (; exponent > 0; exponent >>= 1) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
}
return res;
}
constexpr MInt& operator+=(const MInt& x) {
if ((v += x.v) >= M) v -= M;
return *this;
}
constexpr MInt& operator-=(const MInt& x) {
if ((v += M - x.v) >= M) v -= M;
return *this;
}
constexpr MInt& operator*=(const MInt& x) {
v = (unsigned long long){v} * x.v % M;
return *this;
}
MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }
constexpr auto operator<=>(const MInt& x) const = default;
constexpr MInt& operator++() {
if (++v == M) [[unlikely]] v = 0;
return *this;
}
constexpr MInt operator++(int) {
const MInt res = *this;
++*this;
return res;
}
constexpr MInt& operator--() {
v = (v == 0 ? M - 1 : v - 1);
return *this;
}
constexpr MInt operator--(int) {
const MInt res = *this;
--*this;
return res;
}
constexpr MInt operator+() const { return *this; }
constexpr MInt operator-() const { return raw(v ? M - v : 0); }
constexpr MInt operator+(const MInt& x) const { return MInt(*this) += x; }
constexpr MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
constexpr MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
MInt operator/(const MInt& x) const { return MInt(*this) /= x; }
friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
return os << x.v;
}
friend std::istream& operator>>(std::istream& is, MInt& x) {
long long v;
is >> v;
x = MInt(v);
return is;
}
};
#else // ARBITRARY_MODINT
template <int ID>
struct MInt {
unsigned int v;
constexpr MInt() : v(0) {}
MInt(const long long x) : v(x >= 0 ? x % mod() : x % mod() + mod()) {}
static constexpr MInt raw(const int x) {
MInt x_;
x_.v = x;
return x_;
}
static int get_mod() { return mod(); }
static void set_mod(const unsigned int divisor) { mod() = divisor; }
static void init(const int x) {
inv<true>(x);
fact(x);
fact_inv(x);
}
template <bool MEMOIZES = false>
static MInt inv(const int n) {
// assert(0 <= n && n < mod() && std::gcd(x, mod()) == 1);
static std::vector<MInt> inverse{0, 1};
const int prev = inverse.size();
if (n < prev) return inverse[n];
if constexpr (MEMOIZES) {
// "n!" and "M" must be disjoint.
inverse.resize(n + 1);
for (int i = prev; i <= n; ++i) {
inverse[i] = -inverse[mod() % i] * raw(mod() / i);
}
return inverse[n];
}
int u = 1, v = 0;
for (unsigned int a = n, b = mod(); b;) {
const unsigned int q = a / b;
std::swap(a -= q * b, b);
std::swap(u -= q * v, v);
}
return u;
}
static MInt fact(const int n) {
static std::vector<MInt> factorial{1};
if (const int prev = factorial.size(); n >= prev) {
factorial.resize(n + 1);
for (int i = prev; i <= n; ++i) {
factorial[i] = factorial[i - 1] * i;
}
}
return factorial[n];
}
static MInt fact_inv(const int n) {
static std::vector<MInt> f_inv{1};
if (const int prev = f_inv.size(); n >= prev) {
f_inv.resize(n + 1);
f_inv[n] = inv(fact(n).v);
for (int i = n; i > prev; --i) {
f_inv[i - 1] = f_inv[i] * i;
}
}
return f_inv[n];
}
static MInt nCk(const int n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
fact_inv(n - k) * fact_inv(k));
}
static MInt nPk(const int n, const int k) {
return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k);
}
static MInt nHk(const int n, const int k) {
return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k));
}
static MInt large_nCk(long long n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
inv<true>(k);
MInt res = 1;
for (int i = 1; i <= k; ++i) {
res *= inv(i) * n--;
}
return res;
}
MInt pow(long long exponent) const {
MInt res = 1, tmp = *this;
for (; exponent > 0; exponent >>= 1) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
}
return res;
}
MInt& operator+=(const MInt& x) {
if ((v += x.v) >= mod()) v -= mod();
return *this;
}
MInt& operator-=(const MInt& x) {
if ((v += mod() - x.v) >= mod()) v -= mod();
return *this;
}
MInt& operator*=(const MInt& x) {
v = (unsigned long long){v} * x.v % mod();
return *this;
}
MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }
auto operator<=>(const MInt& x) const = default;
MInt& operator++() {
if (++v == mod()) [[unlikely]] v = 0;
return *this;
}
MInt operator++(int) {
const MInt res = *this;
++*this;
return res;
}
MInt& operator--() {
v = (v == 0 ? mod() - 1 : v - 1);
return *this;
}
MInt operator--(int) {
const MInt res = *this;
--*this;
return res;
}
MInt operator+() const { return *this; }
MInt operator-() const { return raw(v ? mod() - v : 0); }
MInt operator+(const MInt& x) const { return MInt(*this) += x; }
MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
MInt operator/(const MInt& x) const { return MInt(*this) /= x; }
friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
return os << x.v;
}
friend std::istream& operator>>(std::istream& is, MInt& x) {
long long v;
is >> v;
x = MInt(v);
return is;
}
private:
static unsigned int& mod() {
static unsigned int divisor = 0;
return divisor;
}
};
#endif // ARBITRARY_MODINT
} // namespace emthrm
#line 13 "test/data_structure/lazy_segment_tree.test.cpp"
int main() {
using ModInt = emthrm::MInt<998244353>;
int n, q;
std::cin >> n >> q;
struct M {
using Monoid = std::pair<ModInt, int>;
using OperatorMonoid = std::pair<ModInt, ModInt>;
static constexpr Monoid m_id() { return {0, 0}; }
static constexpr OperatorMonoid o_id() { return {1, 0}; }
static Monoid m_merge(const Monoid& a, const Monoid& b) {
return {a.first + b.first, a.second + b.second};
}
static OperatorMonoid o_merge(const OperatorMonoid& a,
const OperatorMonoid& b) {
return {b.first * a.first, b.first * a.second + b.second};
}
static Monoid apply(const Monoid& a, const OperatorMonoid& b) {
return {a.first * b.first + b.second * a.second, a.second};
}
};
std::vector<M::Monoid> a(n, {0, 1});
for (int i = 0; i < n; ++i) {
std::cin >> a[i].first;
}
emthrm::LazySegmentTree<M> seg(a);
while (q--) {
int query, l, r;
std::cin >> query >> l >> r;
if (query == 0) {
int b, c;
std::cin >> b >> c;
seg.apply(l, r, {b, c});
} else if (query == 1) {
std::cout << seg.get(l, r).first << '\n';
}
}
return 0;
}