#line 1 "test/yosupo-judge/range_affine_range_sum/main.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
#include <iostream>
#include <vector>
#line 2 "Mylib/AlgebraicStructure/Monoid/affine.cpp"
#include <utility>
namespace haar_lib {
template <typename T>
struct affine_monoid {
using value_type = std::pair<T, T>;
value_type operator()() const { return std::make_pair(1, 0); }
value_type operator()(const value_type &a, const value_type &b) const {
return std::make_pair(a.first * b.first, a.first * b.second + a.second);
}
};
} // namespace haar_lib
#line 2 "Mylib/AlgebraicStructure/Monoid/sum.cpp"
namespace haar_lib {
template <typename T>
struct sum_monoid {
using value_type = T;
value_type operator()() const { return 0; }
value_type operator()(value_type a, value_type b) const { return a + b; }
};
} // namespace haar_lib
#line 2 "Mylib/AlgebraicStructure/MonoidAction/affine_sum.cpp"
namespace haar_lib {
template <typename MonoidUpdate, typename MonoidGet>
struct affine_sum {
using monoid_get = MonoidGet;
using monoid_update = MonoidUpdate;
using value_type_get = typename MonoidGet::value_type;
using value_type_update = typename MonoidUpdate::value_type;
value_type_get operator()(value_type_get a, value_type_update b, int len) const {
return b.first * a + b.second * len;
}
};
} // namespace haar_lib
#line 2 "Mylib/DataStructure/SegmentTree/lazy_segment_tree.cpp"
#include <cassert>
#line 4 "Mylib/DataStructure/SegmentTree/lazy_segment_tree.cpp"
namespace haar_lib {
template <typename Monoid>
class lazy_segment_tree {
public:
using monoid_get = typename Monoid::monoid_get;
using monoid_update = typename Monoid::monoid_update;
using value_type_get = typename monoid_get::value_type;
using value_type_update = typename monoid_update::value_type;
private:
Monoid M_;
monoid_get M_get_;
monoid_update M_update_;
int depth_, size_, hsize_;
std::vector<value_type_get> data_;
std::vector<value_type_update> lazy_;
void propagate(int i) {
if (lazy_[i] == M_update_()) return;
if (i < hsize_) {
lazy_[i << 1 | 0] = M_update_(lazy_[i], lazy_[i << 1 | 0]);
lazy_[i << 1 | 1] = M_update_(lazy_[i], lazy_[i << 1 | 1]);
}
const int len = hsize_ >> (31 - __builtin_clz(i));
data_[i] = M_(data_[i], lazy_[i], len);
lazy_[i] = M_update_();
}
void propagate_top_down(int i) {
std::vector<int> temp;
while (i > 1) {
i >>= 1;
temp.push_back(i);
}
for (auto it = temp.rbegin(); it != temp.rend(); ++it) propagate(*it);
}
void bottom_up(int i) {
while (i > 1) {
i >>= 1;
propagate(i << 1 | 0);
propagate(i << 1 | 1);
data_[i] = M_get_(data_[i << 1 | 0], data_[i << 1 | 1]);
}
}
public:
lazy_segment_tree() {}
lazy_segment_tree(int n) : depth_(n > 1 ? 32 - __builtin_clz(n - 1) + 1 : 1),
size_(1 << depth_),
hsize_(size_ / 2),
data_(size_, M_get_()),
lazy_(size_, M_update_()) {}
void update(int l, int r, const value_type_update &x) {
assert(0 <= l and l <= r and r <= hsize_);
propagate_top_down(l + hsize_);
if (r < hsize_) propagate_top_down(r + hsize_);
int L = l + hsize_, R = r + hsize_;
while (L < R) {
if (R & 1) {
--R;
lazy_[R] = M_update_(x, lazy_[R]);
propagate(R);
}
if (L & 1) {
lazy_[L] = M_update_(x, lazy_[L]);
propagate(L);
++L;
}
L >>= 1;
R >>= 1;
}
bottom_up(l + hsize_);
if (r < hsize_) bottom_up(r + hsize_);
}
void update(int i, const value_type_update &x) { update(i, i + 1, x); }
value_type_get fold(int l, int r) {
assert(0 <= l and l <= r and r <= hsize_);
propagate_top_down(l + hsize_);
if (r < hsize_) propagate_top_down(r + hsize_);
value_type_get ret_left = M_get_(), ret_right = M_get_();
int L = l + hsize_, R = r + hsize_;
while (L < R) {
if (R & 1) {
--R;
propagate(R);
ret_right = M_get_(data_[R], ret_right);
}
if (L & 1) {
propagate(L);
ret_left = M_get_(ret_left, data_[L]);
++L;
}
L >>= 1;
R >>= 1;
}
return M_get_(ret_left, ret_right);
}
value_type_get fold_all() {
return fold(0, hsize_);
}
value_type_get operator[](int i) { return fold(i, i + 1); }
template <typename T>
void init(const T &val) {
init_with_vector(std::vector<T>(hsize_, val));
}
template <typename T>
void init_with_vector(const std::vector<T> &val) {
data_.assign(size_, M_get_());
lazy_.assign(size_, M_update_());
for (int i = 0; i < (int) val.size(); ++i) data_[hsize_ + i] = (value_type_get) val[i];
for (int i = hsize_; --i > 0;) data_[i] = M_get_(data_[i << 1 | 0], data_[i << 1 | 1]);
}
};
} // namespace haar_lib
#line 2 "Mylib/IO/input_tuples.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuples.cpp"
#include <tuple>
#line 6 "Mylib/IO/input_tuple.cpp"
namespace haar_lib {
template <typename T, size_t... I>
static void input_tuple_helper(std::istream &s, T &val, std::index_sequence<I...>) {
(void) std::initializer_list<int>{(void(s >> std::get<I>(val)), 0)...};
}
template <typename T, typename U>
std::istream &operator>>(std::istream &s, std::pair<T, U> &value) {
s >> value.first >> value.second;
return s;
}
template <typename... Args>
std::istream &operator>>(std::istream &s, std::tuple<Args...> &value) {
input_tuple_helper(s, value, std::make_index_sequence<sizeof...(Args)>());
return s;
}
} // namespace haar_lib
#line 8 "Mylib/IO/input_tuples.cpp"
namespace haar_lib {
template <typename... Args>
class InputTuples {
struct iter {
using value_type = std::tuple<Args...>;
value_type value;
bool fetched = false;
int N, c = 0;
value_type operator*() {
if (not fetched) {
std::cin >> value;
}
return value;
}
void operator++() {
++c;
fetched = false;
}
bool operator!=(iter &) const {
return c < N;
}
iter(int N) : N(N) {}
};
int N;
public:
InputTuples(int N) : N(N) {}
iter begin() const { return iter(N); }
iter end() const { return iter(N); }
};
template <typename... Args>
auto input_tuples(int N) {
return InputTuples<Args...>(N);
}
} // namespace haar_lib
#line 4 "Mylib/IO/input_vector.cpp"
namespace haar_lib {
template <typename T>
std::vector<T> input_vector(int N) {
std::vector<T> ret(N);
for (int i = 0; i < N; ++i) std::cin >> ret[i];
return ret;
}
template <typename T>
std::vector<std::vector<T>> input_vector(int N, int M) {
std::vector<std::vector<T>> ret(N);
for (int i = 0; i < N; ++i) ret[i] = input_vector<T>(M);
return ret;
}
} // namespace haar_lib
#line 4 "Mylib/Number/Mint/mint.cpp"
namespace haar_lib {
template <int32_t M>
class modint {
uint32_t val_;
public:
constexpr static auto mod() { return M; }
constexpr modint() : val_(0) {}
constexpr modint(int64_t n) {
if (n >= M)
val_ = n % M;
else if (n < 0)
val_ = n % M + M;
else
val_ = n;
}
constexpr auto &operator=(const modint &a) {
val_ = a.val_;
return *this;
}
constexpr auto &operator+=(const modint &a) {
if (val_ + a.val_ >= M)
val_ = (uint64_t) val_ + a.val_ - M;
else
val_ += a.val_;
return *this;
}
constexpr auto &operator-=(const modint &a) {
if (val_ < a.val_) val_ += M;
val_ -= a.val_;
return *this;
}
constexpr auto &operator*=(const modint &a) {
val_ = (uint64_t) val_ * a.val_ % M;
return *this;
}
constexpr auto &operator/=(const modint &a) {
val_ = (uint64_t) val_ * a.inv().val_ % M;
return *this;
}
constexpr auto operator+(const modint &a) const { return modint(*this) += a; }
constexpr auto operator-(const modint &a) const { return modint(*this) -= a; }
constexpr auto operator*(const modint &a) const { return modint(*this) *= a; }
constexpr auto operator/(const modint &a) const { return modint(*this) /= a; }
constexpr bool operator==(const modint &a) const { return val_ == a.val_; }
constexpr bool operator!=(const modint &a) const { return val_ != a.val_; }
constexpr auto &operator++() {
*this += 1;
return *this;
}
constexpr auto &operator--() {
*this -= 1;
return *this;
}
constexpr auto operator++(int) {
auto t = *this;
*this += 1;
return t;
}
constexpr auto operator--(int) {
auto t = *this;
*this -= 1;
return t;
}
constexpr static modint pow(int64_t n, int64_t p) {
if (p < 0) return pow(n, -p).inv();
int64_t ret = 1, e = n % M;
for (; p; (e *= e) %= M, p >>= 1)
if (p & 1) (ret *= e) %= M;
return ret;
}
constexpr static modint inv(int64_t a) {
int64_t b = M, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
u %= M;
if (u < 0) u += M;
return u;
}
constexpr static auto frac(int64_t a, int64_t b) { return modint(a) / modint(b); }
constexpr auto pow(int64_t p) const { return pow(val_, p); }
constexpr auto inv() const { return inv(val_); }
friend constexpr auto operator-(const modint &a) { return modint(M - a.val_); }
friend constexpr auto operator+(int64_t a, const modint &b) { return modint(a) + b; }
friend constexpr auto operator-(int64_t a, const modint &b) { return modint(a) - b; }
friend constexpr auto operator*(int64_t a, const modint &b) { return modint(a) * b; }
friend constexpr auto operator/(int64_t a, const modint &b) { return modint(a) / b; }
friend std::istream &operator>>(std::istream &s, modint &a) {
s >> a.val_;
return s;
}
friend std::ostream &operator<<(std::ostream &s, const modint &a) {
s << a.val_;
return s;
}
template <int N>
static auto div() {
static auto value = inv(N);
return value;
}
explicit operator int32_t() const noexcept { return val_; }
explicit operator int64_t() const noexcept { return val_; }
};
} // namespace haar_lib
#line 12 "test/yosupo-judge/range_affine_range_sum/main.test.cpp"
namespace hl = haar_lib;
using mint = hl::modint<998244353>;
using sum = hl::sum_monoid<mint>;
using affine = hl::affine_monoid<mint>;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int N, Q;
std::cin >> N >> Q;
auto seg = hl::lazy_segment_tree<hl::affine_sum<affine, sum>>(N);
auto a = hl::input_vector<mint>(N);
seg.init_with_vector(a);
for (auto [t, l, r] : hl::input_tuples<int, int, int>(Q)) {
if (t == 0) {
int b, c;
std::cin >> b >> c;
seg.update(l, r, std::make_pair(b, c));
} else {
std::cout << seg.fold(l, r) << "\n";
}
}
return 0;
}
test/yosupo-judge/range_affine_range_sum/main.test.cpp
Sum monoid
(Mylib/AlgebraicStructure/Monoid/sum.cpp)