verify/Datastructure_lazysegtree.test.cpp

• View this file on GitHub
• Last update: 2025-01-10 00:00:54+09:00
• Problem: https://judge.yosupo.jp/problem/range_affine_range_sum

Depends on

• lazysegtree (Datastructure/lazysegtree.hpp)
• modint (Utility/modint.hpp)
• verify用テンプレート (Utility/template.hpp)

Code

#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
#include "../Utility/template.hpp"
#include "../Utility/modint.hpp"
#include "../Datastructure/lazysegtree.hpp"
using mint = modint998244353;
struct S {
    mint s; int sz;
};

S op(S l, S r) {
    return S{l.s + r.s, l.sz + r.sz};
}

S e() {
    return S{mint(0), 0};
}

struct F {
    mint a, b;
};

S mapping(F f, S s) {
    S res;
    res.s = f.a * s.s + f.b * s.sz;
    res.sz = s.sz;
    return res;
}

F composition(F l, F r) {
    return F{r.a * l.a, r.b * l.a + l.b};
}

F id() {
    return F{1, 0};
}

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<S> V(N);
    rep(i, 0, N) {
        int a;
        cin >> a;
        V[i] = S{a, 1};
    }
    lazysegtree<S, op, e, F, mapping, composition, id> seg(V);
    while(Q--) {
       // rep(i, 0, N) cout << seg.prod(i, i+1).s.x << " ";
       // cout << endl;
        int t;
        cin >> t;
        if(t == 0) {
            int l, r, b, c;
            cin >> l >> r >> b >> c;
            seg.apply(l, r, F{b, c});
        }
        else {
            int l, r;
            cin >> l >> r;
            cout << seg.prod(l, r).s.x << '\n';
        }
    }
}

#line 1 "verify/Datastructure_lazysegtree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
#line 1 "Utility/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)

#define TT template <typename T>
TT using vec = vector<T>;
template <class T1, class T2> bool chmin(T1 &x, T2 y) {
    return x > y ? (x = y, true) : false;
}
template <class T1, class T2> bool chmax(T1 &x, T2 y) {
    return x < y ? (x = y, true) : false;
}
struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} io_setup;

/*
@brief verify用テンプレート
*/
#line 1 "Utility/modint.hpp"

// 動的mod : template<int mod> を消して、上の方で変数modを宣言
template <uint32_t mod> struct modint {
    using mm = modint;
    uint32_t x;
    modint() : x(0) {}
    TT modint(T a = 0) : x((ll(a) % mod + mod)) {
        if (x >= mod) x -= mod;
    }

    friend mm operator+(mm a, mm b) {
        a.x += b.x;
        if (a.x >= mod) a.x -= mod;
        return a;
    }
    friend mm operator-(mm a, mm b) {
        a.x -= b.x;
        if (a.x >= mod) a.x += mod;
        return a;
    }

    mm operator-() const { return mod - x; }

    //+と-だけで十分な場合、以下は省略して良いです。

    friend mm operator*(mm a, mm b) { return (uint64_t)(a.x) * b.x; }
    friend mm operator/(mm a, mm b) { return a * b.inv(); }
    friend mm &operator+=(mm &a, mm b) { return a = a + b; }
    friend mm &operator-=(mm &a, mm b) { return a = a - b; }
    friend mm &operator*=(mm &a, mm b) { return a = a * b; }
    friend mm &operator/=(mm &a, mm b) { return a = a * b.inv(); }

    mm inv() const {
        assert(x != 0);
        return pow(mod - 2);
    }
    mm pow(ll y) const {
        mm res = 1;
        mm v = *this;
        while (y) {
            if (y & 1) res *= v;
            v *= v;
            y /= 2;
        }
        return res;
    }

    friend istream &operator>>(istream &is, mm &a) {
        ll t;
        cin >> t;
        a = mm(t);
        return is;
    }

    friend ostream &operator<<(ostream &os, mm a) { return os << a.x; }

    bool operator==(mm a) { return x == a.x; }
    bool operator!=(mm a) { return x != a.x; }

    bool operator<(const mm &a) const { return x < a.x; }
};
using modint998244353 = modint<998244353>;
using modint1000000007 = modint<1'000'000'007>;
/*
@brief modint
*/
#line 1 "Datastructure/lazysegtree.hpp"
template <class S,
          S (*op)(S, S),
          S (*e)(),
          class F,
          S (*mp)(F, S),
          F (*cm)(F, F),
          F (*id)()>
struct lazysegtree {
    int n;
    int sz;
    int log;
    vec<S> d;
    vec<F> lz;
    lazysegtree(int n) : lazysegtree(vec<S>(n, e())) {}
    lazysegtree(const vec<S> &v) : n((int)(v.size())) {
        log = 1;
        while ((1 << log) < n) log++;
        sz = 1 << log;
        d.resize(2 * sz, e());
        lz.resize(2 * sz, id());
        rep(i, 0, n) d[sz + i] = v[i];
        rrep(i, 1, sz) update(i);
    }

    void update(int i) { d[i] = op(d[i << 1], d[i << 1 | 1]); }

    void all_apply(int i, F f) {
        d[i] = mp(f, d[i]);
        if (i < sz) lz[i] = cm(f, lz[i]);
    }

    void push(int k) {
        all_apply(k * 2, lz[k]);
        all_apply(k * 2 + 1, lz[k]);
        lz[k] = id();
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= n);
        if (l == r) return e();

        l += sz;
        r += sz;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= n);
        if (l == r) return;

        l += sz;
        r += sz;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    // 以下、必要になったら書く（全て独立)

    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= n);
        assert(g(e()));
        if (l == n) return n;
        l += sz;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < sz) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return n;
    }

    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= n);
        assert(g(e()));
        if (r == 0) return 0;
        r += sz;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < sz) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

    void set(int p, S x) {
        assert(0 <= p && p < n);
        p += sz;
        rrep(i, 1, log + 1) push(p >> i);
        d[p] = x;
        rep(i, 1, log + 1) update(p >> i);
    }

    S all_prod() { return d[1]; }

    S get(int p) {
        assert(0 <= p && p < n);
        p += sz;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    void apply(int p, F f) {
        assert(0 <= p && p < n);
        p += sz;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
};

/*
@brief lazysegtree
@docs doc/lazysegtree.md
*/
#line 5 "verify/Datastructure_lazysegtree.test.cpp"
using mint = modint998244353;
struct S {
    mint s; int sz;
};

S op(S l, S r) {
    return S{l.s + r.s, l.sz + r.sz};
}

S e() {
    return S{mint(0), 0};
}

struct F {
    mint a, b;
};

S mapping(F f, S s) {
    S res;
    res.s = f.a * s.s + f.b * s.sz;
    res.sz = s.sz;
    return res;
}

F composition(F l, F r) {
    return F{r.a * l.a, r.b * l.a + l.b};
}

F id() {
    return F{1, 0};
}

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<S> V(N);
    rep(i, 0, N) {
        int a;
        cin >> a;
        V[i] = S{a, 1};
    }
    lazysegtree<S, op, e, F, mapping, composition, id> seg(V);
    while(Q--) {
       // rep(i, 0, N) cout << seg.prod(i, i+1).s.x << " ";
       // cout << endl;
        int t;
        cin >> t;
        if(t == 0) {
            int l, r, b, c;
            cin >> l >> r >> b >> c;
            seg.apply(l, r, F{b, c});
        }
        else {
            int l, r;
            cin >> l >> r;
            cout << seg.prod(l, r).s.x << '\n';
        }
    }
}

Back to top page