【线段树】ACW 1277. 维护序列

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <bitset>


using namespace std;

const int N = 1e5 + 100;

using ll = long long;
int n, m, p;

ll w[N];

struct Node {
    ll l, r;
    ll sum, add, mul; // add,mul为懒标记
} tr[N * 4];


inline void pushup(Node &u, Node &l, Node &r) {
    u.sum = (l.sum + r.sum) % p;
}

inline void pushup(ll u) {
    pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}

inline ll eval(Node &t, int add, int mul) {
    t.sum = ((ll) t.sum * mul + (ll) (t.r - t.l + 1) * add) % p;
    t.mul = (ll) t.mul * mul % p;
    t.add = ((ll) t.add * mul + add) % p;
}

inline void pushdown(ll u) {
    eval(tr[u << 1], tr[u].add, tr[u].mul);
    eval(tr[u << 1 | 1], tr[u].add, tr[u].mul);
    tr[u].add = 0, tr[u].mul = 1;
}

void build(ll u, ll l, ll r) {
    if (l == r) {
        ll b = w[r];
        tr[u] = {l, l, b, 0, 1};
    } else {
        pushdown(u);
        tr[u] = {l, r, 0, 0, 1};
        ll mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}

// 1为+，0为*
void modify(ll u, ll l, ll r, ll add, int mul) {
    if (tr[u].l >= l && tr[u].r <= r) {
        eval(tr[u], add, mul);
    } else {
        pushdown(u);
        ll mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, add, mul);
        if (r > mid) modify(u << 1 | 1, l, r, add, mul);
        pushup(u);
    }
}

ll query(ll u, ll l, ll r) {
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    else {
        pushdown(u);
        ll mid = tr[u].l + tr[u].r >> 1;
        ll sum = 0;
        if (l <= mid) sum += query(u << 1, l, r);
        if (r > mid) sum += query(u << 1 | 1, l, r);
        return sum % p;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n >> p;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build(1, 1, n);
    cin >> m;
    int op, t, g, c;
    while (m--) {
        cin >> op >> t >> g;
        if (op == 1) {
            cin >> c;
            modify(1, t, g, 0, c);
        } else if (op == 2) {
            cin >> c;
            modify(1, t, g, c, 1);
        } else {
            cout << query(1, t, g) << endl;
        }
    }
    return 0;
}