DataStructure/SegTree/Affline.h

• View this file on GitHub
• Last update: 2025-05-08 02:01:24+07:00

Depends on

• template.h

Verified with

• DataStructure/Range_affine_point_get.test.cpp
• DataStructure/Range_affine_range_sum.test.cpp

Code

#include "../../template.h"

template <typename T>
struct AfflineSegTree {
    vector<T> st;
    vector<pll> lazy;

    AfflineSegTree() {}
    AfflineSegTree(int n): st(n*4), lazy(n*4) {}

    void build(int id, int l, int r, const vector<ll> &a) {
        lazy[id] = {1, 0};
        if (l == r) {
            st[id] = a[l] % mod;
            return;
        }
        int m = (l + r) >> 1;
        build(id*2, l, m, a);
        build(id*2+1, m+1, r, a);
        st[id] = (st[id*2] + st[id*2+1]) % mod;
    }

    void push(int id, int l, int r) {
        int m = (l + r) >> 1;
        apply(id*2, l, m, lazy[id]);
        apply(id*2+1, m+1, r, lazy[id]);
        lazy[id] = {1, 0};
    }

    void apply(int id, int l, int r, pll val) {
        int len = r-l+1;
        st[id] = (st[id] * val.fi % mod + val.se * len % mod) % mod;
        lazy[id].fi = lazy[id].fi * val.fi % mod;
        lazy[id].se = (lazy[id].se * val.fi % mod + val.se) % mod;
    }

    void update(int id, int l, int r, int u, int v, pll val) {
        if (v < l || u > r)
            return;
        if (u <= l && v >= r) {
            apply(id, l, r, val);
            return;
        }
        push(id, l, r);
        int mid = (l + r) >> 1;
        update(id*2, l, mid, u, v, val);
        update(id*2+1, mid+1, r, u, v, val);
        st[id] = (st[id*2] + st[id*2+1]) % mod;
    }

    T getSumMod(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return st[id];
        int mid = (l + r) >> 1;
        push(id, l, r);
        T t1 = getSumMod(id*2, l, mid, u, v) % mod;
        T t2 = getSumMod(id*2+1, mid+1, r, u, v) % mod;
        return (t1 + t2) % mod;
    }
};

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "DataStructure/SegTree/Affline.h"

template <typename T>
struct AfflineSegTree {
    vector<T> st;
    vector<pll> lazy;

    AfflineSegTree() {}
    AfflineSegTree(int n): st(n*4), lazy(n*4) {}

    void build(int id, int l, int r, const vector<ll> &a) {
        lazy[id] = {1, 0};
        if (l == r) {
            st[id] = a[l] % mod;
            return;
        }
        int m = (l + r) >> 1;
        build(id*2, l, m, a);
        build(id*2+1, m+1, r, a);
        st[id] = (st[id*2] + st[id*2+1]) % mod;
    }

    void push(int id, int l, int r) {
        int m = (l + r) >> 1;
        apply(id*2, l, m, lazy[id]);
        apply(id*2+1, m+1, r, lazy[id]);
        lazy[id] = {1, 0};
    }

    void apply(int id, int l, int r, pll val) {
        int len = r-l+1;
        st[id] = (st[id] * val.fi % mod + val.se * len % mod) % mod;
        lazy[id].fi = lazy[id].fi * val.fi % mod;
        lazy[id].se = (lazy[id].se * val.fi % mod + val.se) % mod;
    }

    void update(int id, int l, int r, int u, int v, pll val) {
        if (v < l || u > r)
            return;
        if (u <= l && v >= r) {
            apply(id, l, r, val);
            return;
        }
        push(id, l, r);
        int mid = (l + r) >> 1;
        update(id*2, l, mid, u, v, val);
        update(id*2+1, mid+1, r, u, v, val);
        st[id] = (st[id*2] + st[id*2+1]) % mod;
    }

    T getSumMod(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return st[id];
        int mid = (l + r) >> 1;
        push(id, l, r);
        T t1 = getSumMod(id*2, l, mid, u, v) % mod;
        T t2 = getSumMod(id*2+1, mid+1, r, u, v) % mod;
        return (t1 + t2) % mod;
    }
};

Back to top page