洛谷 P3373 【模板】线段树 2

题目传送门

本题相对于模板1多了乘法,但是代码里面加入了要考虑优先级的因素,所以并不是很好写.

AC代码:

#include<cstdio>
#include<iostream>

using namespace std;

int n,m,p;
long long a[100001];
struct kkk {
    long long v,mul,add;
}e[400005]; 

inline void build(int bh,int l,int r) {
    e[bh].mul = 1;
    e[bh].add = 0;
    if(l == r) {
        e[bh].v = a[l] % p;
        return ;    
    }
    int mid = l + r >> 1;
    build(bh * 2,l,mid);
    build(bh * 2 + 1,mid + 1,r);
    e[bh].v = e[bh*2].v + e[bh*2+1].v;
    e[bh].v %= p;
    return ;
}

inline void pushdown(int bh,int l,int r) {
    int mid = (l + r) >> 1;
    e[bh*2].v = (e[bh*2].v * e[bh].mul + e[bh].add * (mid - l + 1)) % p;
    e[bh*2+1].v = (e[bh*2+1].v * e[bh].mul + e[bh].add * (r - mid)) % p;
    e[bh*2].mul = (e[bh*2].mul * e[bh].mul) % p;
    e[bh*2+1].mul = (e[bh*2+1].mul * e[bh].mul) % p;
    e[bh*2].add = (e[bh*2].add * e[bh].mul + e[bh].add) % p;
    e[bh*2+1].add = (e[bh*2+1].add * e[bh].mul + e[bh].add) % p;
    e[bh].mul = 1;
    e[bh].add = 0;
    return ;
}

inline void update_Multiply(int bh,int ll,int rr,int l,int r,long long _v) {
    if(r < ll || l > rr)
        return ;
    if(l <= ll && r >= rr) {
        e[bh].v = (e[bh].v * _v) % p;
        e[bh].mul = (e[bh].mul * _v) % p;
        e[bh].add = (e[bh].add * _v) % p;
        return ; 
    }    
    pushdown(bh,ll,rr);
    int mid = (ll + rr) >> 1;
    update_Multiply(bh * 2,ll,mid,l,r,_v);
    update_Multiply(bh * 2 + 1,mid + 1,rr,l,r,_v);
    e[bh].v = (e[bh*2].v + e[bh*2+1].v) % p;
    return ;
}

inline void update_Plus(int bh,int ll,int rr,int l,int r,long long _v) {
    if(r < ll || rr < l)
        return ;
    if(l <= ll && r >= rr) { 
        e[bh].add = (e[bh].add + _v) % p;
        e[bh].v = (e[bh].v + _v * (rr - ll + 1)) % p;
        return ;
    }
    pushdown(bh,ll,rr);
    int mid = (ll + rr) >> 1;
    update_Plus(bh * 2,ll,mid,l,r,_v);
    update_Plus(bh * 2 + 1,mid + 1,rr,l,r,_v);
    e[bh].v = (e[bh*2].v + e[bh*2+1].v) % p;
    return ;
} 

long long query(int bh,int ll,int rr,int l,int r) {
    if(r < ll || l > rr) 
        return 0;
    if(l <= ll && r >= rr)
        return e[bh].v;
    pushdown(bh,ll,rr);
    int mid = (ll + rr) >> 1;
    return (query(bh * 2,ll,mid,l,r) + query(bh * 2 + 1,mid + 1,rr,l,r)) % p;
}

int main()
{
    scanf("%d%d%d",&n,&m,&p);
    for(int i = 1;i <= n; i++)
        scanf("%lld",&a[i]);
    build(1,1,n);
    while(m--) {
        int u,x,y;
        long long k;
        scanf("%d",&u);
        if(u == 1) {
            scanf("%d%d%lld",&x,&y,&k);
            update_Multiply(1,1,n,x,y,k);
        }
        if(u == 2) {
            scanf("%d%d%lld",&x,&y,&k);
            update_Plus(1,1,n,x,y,k);
        }
        if(u == 3) {
            scanf("%d%d",&x,&y);
            printf("%lld
",query(1,1,n,x,y) % p);
        }
    }
    return 0;
}