【LuoguP3373】线段树模板（区间加法，乘法）

概述

已知一个数列，你需要进行下面三种操作：

将某区间每一个数乘上 x

将某区间每一个数加上 x

求出某区间每一个数的和

链接

传送门

分析

要维护乘法和加法的两个标签，注意乘法和加法优先级的问题，比如在push_down的过程中，在乘法和加法同时存在的时候，儿子的add标签应该是先乘上父亲的mul标签，然后再加父亲的add标签，应为原先的加法在乘法的过程中也参与了乘法运算，在区间乘法的操作过程中，除了要对区间sum，mul做乘法还要对add进行乘法操作，可自行验证其正确性，还有每一步的取模操作。

代码

845ms，很快啊。

#include <iostream>
#include <cstdio>
#include <cctype>
#define mid (l + r >> 1)
typedef long long ll;
const int N = 1e5 + 10;
int n, m, p;
inline int read(){
    int x = 0; char ch = getchar();
    while (!isdigit(ch)) ch = getchar();
    while (isdigit(ch)){x = (x<<1)+(x<<3)+(ch^48), ch = getchar();}
    return x;
}

ll sum[N << 2], add[N << 2], mul[N << 2];

inline void push_up(int i){
    sum[i] = (sum[i << 1] + sum[i << 1|1]) % p;
}

inline void push_down(int i, int l, int r){
    if (add[i] == 0 && mul[i] == 1) return;

    sum[i << 1] = (sum[i << 1] * mul[i] + add[i] * (mid - l + 1)) % p;
    sum[i << 1|1] = (sum[i << 1|1] * mul[i] + add[i] * (r - mid)) % p;
    mul[i << 1] = (mul[i << 1] * mul[i]) % p;
    mul[i << 1|1] = (mul[i << 1|1] * mul[i]) % p;
    add[i << 1] = (add[i << 1] * mul[i] + add[i]) % p;
    add[i << 1|1] = (add[i << 1|1] * mul[i] + add[i]) % p;
    add[i] = 0, mul[i] = 1;

}
inline void buildTree(int i, int l, int r){
    mul[i] = 1;
    if (l == r){
        sum[i] = read();
        return;
    }

    buildTree(i << 1, l, mid);
    buildTree(i << 1|1, mid + 1, r);
    push_up(i);
}

inline void mul_interval(int i, int l, int r, int crtl, int crtr, ll k){
    if (l > crtr || r < crtl) return;
    if (l >= crtl && r <= crtr){
        sum[i] = (sum[i] * k) % p;
        add[i] = (add[i] * k) % p;
        mul[i] = (mul[i] * k) % p;
        return;
    }

    push_down(i, l, r);
    if (mid >= crtl)
        mul_interval(i << 1, l, mid, crtl, crtr, k);
    if (mid < crtr)
        mul_interval(i << 1|1, mid + 1, r, crtl, crtr, k);
    push_up(i);
}

inline void add_interval(int i, int l, int r, int crtl, int crtr, ll val){
    if (l > crtr || r < crtl) return;
    if (l >= crtl && r <= crtr){
        sum[i] = (sum[i] + (r - l + 1) * val) % p;
        add[i] = (add[i] + val) % p;
        return;
    }

    push_down(i, l, r);
    if (mid >= crtl)
        add_interval(i << 1, l, mid, crtl, crtr, val);
    if (mid < crtr)
        add_interval(i << 1|1, mid + 1, r, crtl, crtr, val);
    push_up(i);
}

inline ll query_interval(int i, int l ,int r, int crtl, int crtr){
    if (l > crtr || r < crtl) return 0;
    if (l >= crtl && r <= crtr) return sum[i];

    push_down(i, l, r);
    ll res = 0;
    if (mid >= crtl)
        res += query_interval(i << 1, l, mid, crtl, crtr);
    if (mid < crtr)
        res += query_interval(i << 1|1, mid + 1, r, crtl, crtr);
    return res % p;
}

int main(){
    n = read(), m = read(), p = read();
    buildTree(1, 1, n);
    int op = 0, x = 0, y = 0;
    ll z = 0;
    while (m--){
        op = read();
        if (op == 1){
            x = read(), y = read(), z = read();
            mul_interval(1, 1, n, x, y, z);
        }else if (op == 2){
            x = read(), y = read(), z = read();
            add_interval(1, 1, n, x, y, z);
        }else{
            x = read(), y = read();
            printf("%lld\n", query_interval(1, 1, n, x, y));
        }
    }
    return 0;
}