洛谷P2023 [AHOI2009]维护序列

数据比线段树2要毒瘤，一直60分的原因是：

1.long long 没开

2.没有边做边%或者像我P3373一样写了个看着像的边做边%

3.要看注释的话可以跳到P3373

上代码

#include<iostream>
#include<cmath> 
#include<cstdio>
#include<cstring>
#include<queue>
#define lson i*2,l,mid
#define rson i*2+1,mid+1,r
using namespace std;

struct tree{
    long long mul;
    long long add;
    long long sum;
    long long l,r; 
}t[400860];

long long n,m,a[100860],p;

void build_tree(long long i,long long l,long long r)
{
    t[i].l=l;
    t[i].r=r;
    t[i].mul=1;
    t[i].sum=0;
    t[i].add=0; 
    if(l==r)
    {
        t[i].sum=a[l]%p;
        return ;
    }
    long long mid=(l+r)/2;
    build_tree(lson);
    build_tree(rson);
    t[i].sum=(t[i*2].sum+t[i*2+1].sum)%p;
}

void pushdown2(long long i)
{
    t[i*2].mul=t[i].mul%p*t[i*2].mul%p;
    t[i*2+1].mul=t[i].mul%p*t[i*2+1].mul%p;
    t[i*2].add=(t[i*2].add%p*t[i].mul%p+t[i].add)%p;
    t[i*2+1].add=(t[i*2+1].add%p*t[i].mul%p+t[i].add)%p;
    t[i*2].sum=(t[i].mul%p*t[i*2].sum%p+t[i].add%p*(t[i*2].r-t[i*2].l+1))%p;
    t[i*2+1].sum=(t[i].mul%p*t[i*2+1].sum+t[i].add%p*(t[i*2+1].r-t[i*2+1].l+1))%p;
    t[i].add=0;
    t[i].mul=1;
}
void pushdown(long long i)
{
    t[i*2].mul=t[i].mul%p*t[i*2].mul%p;
    t[i*2+1].mul=t[i*2+1].mul%p*t[i].mul%p;
    t[i*2].add=(t[i*2].add%p*t[i].mul%p+t[i].add)%p;
    t[i*2+1].add=(t[i*2+1].add%p*t[i].mul%p+t[i].add)%p;
    t[i*2].sum=(t[i].mul%p*t[i*2].sum%p+t[i].add%p*(t[i*2].r-t[i*2].l+1))%p;
    t[i*2+1].sum=(t[i].mul%p*t[i*2+1].sum%p+t[i].add%p*(t[i*2+1].r-t[i*2+1].l+1))%p;
    t[i].add=0;
    t[i].mul=1;
}
void mul_tree(long long i,long long l,long long r,long long x,long long y,long long a)
{
    if(l>=x&&r<=y)
    {
        t[i].sum*=a%p;
        t[i].sum%=p; 
        t[i].mul*=a%p;
        t[i].mul%=p; 
        t[i].add*=a%p;
        t[i].mul%=p; 
        return ;
    }
    pushdown(i);
    long long mid=(l+r)/2;
    if(x<=mid) mul_tree(lson,x,y,a);
    if(y>mid) mul_tree(rson,x,y,a);
    t[i].sum=(t[i*2].sum+t[i*2+1].sum)%p;
}
void add_tree(long long i,long long l,long long r,long long x,long long y,long long a)
{
    if(l>=x&&r<=y)
    {
        //t[i].mul*=a%p;    
        t[i].add+=a%p;
        t[i].add%=p;
        t[i].sum+=(t[i].r-t[i].l+1)*a%p;
        t[i].sum%=p;
        return ;
    }
    pushdown(i);
    long long mid=(l+r)/2;
    if(x<=mid) add_tree(lson,x,y,a);
    if(y>mid) add_tree(rson,x,y,a);
    t[i].sum=(t[i*2].sum+t[i*2+1].sum)%p;
 } 
 
long long query_tree(long long i,long long l,long long r,long long a,long long b)
{
     if(l>=a&&r<=b)
     {
         return t[i].sum%p;
    }
    long long mid=(l+r)/2;
    long long ans=0;
    pushdown(i);
    if(a<=mid) ans+=query_tree(lson,a,b)%p;
    if(b>mid) ans+=query_tree(rson,a,b)%p;
    return ans%p;
    
}
int main()
{
    scanf("%lld %lld ",&n,&p);
    long long i,j;
    for(i=1;i<=n;i++)
    scanf("%lld ",&a[i]); 
    scanf("%lld ",&m);
    build_tree(1,1,n);
    for(i=1;i<=m;i++)
    {
        long long k;
        long long t1,t2,t3;
        scanf("%lld ",&k);
        if(k==1)
        {
            scanf("%lld %lld %lld ",&t1,&t2,&t3);
            mul_tree(1,1,n,t1,t2,t3);    
            //printf("%lld \n",query_tree(1,1,n,t1,t2)%p);
        }
        if(k==2)
        {
            scanf("%lld %lld %lld ",&t1,&t2,&t3);
            add_tree(1,1,n,t1,t2,t3);
            //printf("%lld \n",query_tree(1,1,n,t1,t2)%p);
        }
        if(k==3)
        {
            scanf("%lld %lld ",&t1,&t2);
            printf("%lld \n",query_tree(1,1,n,t1,t2)%p);
        }
     } 
     return 0;
}