1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ 20 GCC */

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

#include <iostream><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <utility>
#include "snippet/aliases.hpp"
#include "snippet/fast_io.hpp"
#include "snippet/iterations.hpp"
#include "adaptor/io.hpp"
#include "adaptor/vector.hpp"
#include "numeric/modular/modint.hpp"
#include "algebraic/affine.hpp"
#include "data_structure/dynamic_segment_tree.hpp"
#include "view/zip.hpp"
#include "action/helpers.hpp"

using uni::algebraic::affine;
using mint = uni::modint998244353;

signed main() {
    uni::i32 n, q; input >> n >> q;
    uni::vector<uni::spair<uni::i32>> f(n); input >> f;

    // uni::views::zip(std::views::iota(0, n), std::views::iota(0, n))
    uni::dynamic_segment_tree<uni::actions::make_operatable_t<affine<mint>>> data(f);
    // REPD(i, n) data.set(i, std::make_pair(i, i));
    debug(data.dump_rich());

    LOOP(q) {
        uni::i32 t; input >> t;
        if(t == 0) {
            uni::i32 p, a, b; input >> p >> a >> b;
            data[p] = { a, b };
        }
        if(t == 1) {
            uni::i32 l, r, x; input >> l >> r >> x;
            auto [a, b] = data.fold(l, r).val();
            print(a * x + b);
        }

        debug(data.dump_rich());
    }
}