没调出来 P2023

#include<iostream>
#include<cstdio>
#include<cstring>

#define ll long long
#define N 100010

using namespace std;
ll ans,mod;
int n,m;
struct tree
{
    int l,r;
    int mul_,sum_;
    long long sum;
}tr[N<<];

void pushup(int k)
{
    tr[k].sum=(tr[k<<].sum+tr[k<<|].sum)%mod;
}

void build(int k,int l,int r)
{
    tr[k].l=l;tr[k].r=r;tr[k].sum_=;tr[k].mul_=;
    if(l==r)
    {
        scanf("%lld",&tr[k].sum);
        return;
    }
    int mid=(l+r)>>;
    build(k<<,l,mid);build(k<<|,mid+,r);
    pushup(k);
}

void down_sum(int k)
{
    tr[k<<].sum_=(tr[k].sum_+tr[k<<].sum)%mod;
    tr[k<<|].sum_=(tr[k].sum_+tr[k<<|].sum)%mod;
    tr[k<<].sum+=(tr[k<<].r-tr[k<<].l+)*tr[k<<].sum_;
    tr[k<<].sum%=mod;
    tr[k<<|].sum+=(tr[k<<|].r-tr[k<<|].l+)*tr[k<<|].sum_;
    tr[k<<|].sum%=mod;
    tr[k].sum_=;
}

void down_mul(int k)
{
    tr[k<<].mul_=(tr[k<<].mul_*tr[k].mul_)%mod;
    tr[k<<|].mul_=(tr[k<<|].mul_*tr[k].mul_)%mod;
    tr[k<<].sum_=(tr[k<<].sum_*tr[k].mul_)%mod;
    tr[k<<].sum_=(tr[k<<|].sum_*tr[k].mul_)%mod;

    tr[k<<].sum_=(tr[k<<].sum*tr[k<<].mul_)%mod;
    tr[k<<].sum+=(tr[k<<].r-tr[k<<].l+)*tr[k<<].sum_;
    tr[k<<].sum%=mod;

    tr[k<<].sum_=(tr[k<<|].sum*tr[k<<|].mul_)%mod;
    tr[k<<|].sum+=(tr[k<<|].r-tr[k<<|].l+)*tr[k<<|].sum_;
    tr[k<<|].sum%=mod;

    tr[k].mul_=;
}

void changesum(int k,int l,int r,int c)
{
    if(l>r||r<l) return;
    if(tr[k].l==l && tr[k].r==r)
    {
        tr[k].sum_+=c;
        tr[k].sum+=(tr[k].r-tr[k].l+)*tr[k].sum_;
        tr[k].sum%=mod;
        return;
    }
    if(tr[k].mul_!=) down_mul(k);
    if(tr[k].sum_) down_sum(k);
    int mid=(tr[k].l+tr[k].r)>>;
    if(r<=mid) changesum(k<<,l,r,c);
    else if(l>mid) changesum(k<<|,l,r,c);
    else changesum(k<<,l,mid,c),changesum(k<<|,mid+,r,c);
    pushup(k);
}

void changemul(int k,int l,int r,int c)
{
    if(l>r||r<l) return;
    if(tr[k].l==l && tr[k].r==r)
    {
        tr[k].mul_*=c;
        tr[k].sum_*=c;
        tr[k].sum*=c%mod;
        //tr[k].sum+=(tr[k].r-tr[k].l+1)*tr[k].sum_;
        tr[k].sum%=mod;
        return;
    }
    if(tr[k].mul_!=) down_mul(k);
    if(tr[k].sum_) down_sum(k);
    int mid=(tr[k].l+tr[k].r)>>;
    if(r<=mid) changemul(k<<,l,r,c);
    else if(l>mid) changemul(k<<|,l,r,c);
    else changemul(k<<,l,mid,c),changemul(k<<|,mid+,r,c);
    pushup(k);
}

int query(int k,int l,int r)
{
    if(l>r||r<l) return ;
    if(tr[k].l==l && tr[k].r==r)
    return tr[k].sum%mod;//
    if(tr[k].mul_!=) down_mul(k);
    if(tr[k].sum_) down_sum(k);
    int mid=(tr[k].r+tr[k].l)>>;
    if(r<=mid) return query(k<<,l,r)%mod;
    else if(l>mid) return query(k<<|,l,r)%mod;
    else return query(k<<,l,mid)%mod+query(k<<|,mid+,r)%mod;
}

int main()
{
    scanf("%d%lld",&n,&mod);
    build(,,n);
    scanf("%d",&m);
    int x,y,f,c;
    for(int i=;i<=m;i++)
    {
        scanf("%d",&f);
        if(f==)
        {
            scanf("%d%d%d",&x,&y,&c);
            changemul(,x,y,c);
        }
        else if(f==)
        {
            scanf("%d%d%d",&x,&y,&c);
            changesum(,x,y,c);
        }
        else
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",query(,x,y)%mod);
        }
    }
    return ;
}