[模板] 线段树

题源：https://www.luogu.org/problem/P3373

code

#include <bits/stdc++.h>

#define numm ch - 48
#define pd putchar(' ')
#define pn putchar('\n')
#define pb push_back
#define fi first
#define se second
#define fre1 freopen("1.txt", "r", stdin)
#define fre2 freopen("2.txt", "w", stdout)
typedef long long int ll;
typedef long long int LL;
using namespace std;

template<typename T>
void read(T &res) {
    bool flag = false;
    char ch;
    while (!isdigit(ch = getchar())) (ch == '-') && (flag = true);
    for (res = numm; isdigit(ch = getchar()); res = (res << 1) + (res << 3) + numm);
    flag && (res = -res);
}

template<typename T>
void write(T x) {
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}

//static auto _ = []() {
//    ios::sync_with_stdio(false);
//    cin.tie(0);
//    return 0;
//}();
//#pragma GCC optimize(3,"Ofast","inline")
//
#define left l,mid,k<<1
#define right mid+1,r,k<<1|1
#define lef k<<1
#define rig k<<1|1

const int maxn = 1e5 + 5;

int n, m, p, f, x, y, kk;

ll a[maxn << 2], tr[maxn << 2], lazy_ad[maxn << 2], lazy_mu[maxn << 2];

void build(int l, int r, int k) {
    lazy_mu[k] = 1;
    if (l == r) read(tr[k]);
    else {
        int mid = (l + r) >> 1;
        build(left);
        build(right);
        tr[k] = (tr[lef] + tr[rig]) % p;
    }
}

void push(int l, int r, int k, ll a, ll b) {
    lazy_ad[k] = (lazy_ad[k] * b + a) % p;
    lazy_mu[k] = (lazy_mu[k] * b) % p;
    tr[k] = (tr[k] * b + (r - l + 1) * a) % p;
}

void down(int l, int r, int k) {
    int mid = (l + r) >> 1;
    push(left, lazy_ad[k], lazy_mu[k]);
    push(right, lazy_ad[k], lazy_mu[k]);
    lazy_ad[k] = 0;
    lazy_mu[k] = 1;
}

void midefy(int l, int r, int k, ll a, ll b) {
    if (x <= l && r <= y) push(l, r, k, a, b);
    else {
        if (lazy_ad[k] != 0 || lazy_mu[k] != 1) down(l, r, k);
        int mid = (l + r) >> 1;
        if (x <= mid) midefy(left, a, b);
        if (y > mid) midefy(right, a, b);
        tr[k] = (tr[lef] + tr[rig]) % p;
    }
}

ll ask(int l, int r, int k) {
    if (x <= l && r <= y) return tr[k];
    if (lazy_ad[k] != 0 || lazy_mu[k] != 1) down(l, r, k);
    int mid = (l + r) >> 1;
    ll ans = 0;
    if (x <= mid) ans = (ans + ask(left)) % p;
    if (y > mid) ans = (ans + ask(right)) % p;
    return ans;
}

int main() {
    read(n), read(m), read(p);
    build(1, n, 1);
    while (m--) {
        read(f);
        if (f == 1) { //区间加
            read(x), read(y), read(kk);
            midefy(1,n,1,0,kk);
        } else if (f == 2) { //区间乘
            read(x), read(y), read(kk);
            midefy(1, n, 1, kk, 1);
        } else { // 区间查询
            read(x), read(y);
            write(ask(1, n, 1)), pn;
        }
    }
    return 0;
}