比赛 2025.3.6 评测结果 AAAAAAAAAA
题目名称 WHZ 的序列 最终得分 100
用户昵称 郑霁桓 运行时间 2.510 s
代码语言 C++ 内存使用 9.34 MiB
提交时间 2025-03-06 21:39:30
显示代码纯文本
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[200005],s1[800005],s2[800005],lz1[800005],lz2[800005],op,x,y,z,xx,yy,xxx,yyy;
void build1(long long l,long long r,long long p){
	if(l==r){s1[p]=a[l*2];return;} 
	long long md=(l+r)>>1;
	build1(l,md,p*2),build1(md+1,r,p*2+1);
	s1[p]=s1[p*2]+s1[p*2+1];
}
void build2(long long l,long long r,long long p){
	if(l==r){s2[p]=a[l*2-1];return;} 
	long long md=(l+r)>>1;
	build2(l,md,p*2),build2(md+1,r,p*2+1);
	s2[p]=s2[p*2]+s2[p*2+1];
}
void up1(long long l,long long r,long long mm,long long p){
	s1[p*2]+=lz1[p]*(mm-l+1),s1[p*2+1]+=lz1[p]*(r-mm);
	lz1[p*2]+=lz1[p],lz1[p*2+1]+=lz1[p],lz1[p]=0;
}
void up2(long long l,long long r,long long mm,long long p){
	s2[p*2]+=lz2[p]*(mm-l+1),s2[p*2+1]+=lz2[p]*(r-mm);
	lz2[p*2]+=lz2[p],lz2[p*2+1]+=lz2[p],lz2[p]=0;
}
void ad1(long long x,long long y,long long l,long long r,long long k,long long p){
    if(x>y) return;
	if(x<=l&&r<=y){s1[p]+=k*(r-l+1),lz1[p]+=k;return;}
	long long md=(l+r)>>1;
	if(lz1[p]) up1(l,r,md,p);
	if(x<=md) ad1(x,y,l,md,k,p*2);
	if(md+1<=y) ad1(x,y,md+1,r,k,p*2+1);
	s1[p]=s1[p*2]+s1[p*2+1];
}
void ad2(long long x,long long y,long long l,long long r,long long k,long long p){
    if(x>y) return;
	if(x<=l&&r<=y){s2[p]+=k*(r-l+1),lz2[p]+=k;return;}
	long long md=(l+r)>>1;
	if(lz2[p]) up2(l,r,md,p);
	if(x<=md) ad2(x,y,l,md,k,p*2);
	if(md+1<=y) ad2(x,y,md+1,r,k,p*2+1);
	s2[p]=s2[p*2]+s2[p*2+1];
}
long long q1(long long x,long long y,long long l,long long r,long long p){
    if(x>y) return 0;
	if(x<=l&&r<=y) return s1[p];
	long long md=(l+r)>>1,ss=0;
	if(lz1[p]) up1(l,r,md,p);
	if(x<=md) ss+=q1(x,y,l,md,p*2);
	if(md+1<=y) ss+=q1(x,y,md+1,r,p*2+1);
	s1[p]=s1[p*2]+s1[p*2+1];
	return ss;
}
long long q2(long long x,long long y,long long l,long long r,long long p){
    if(x>y) return 0;
    if(x<=l&&r<=y) return s2[p];
	long long md=(l+r)>>1,ss=0;
	if(lz2[p]) up2(l,r,md,p);
	if(x<=md) ss+=q2(x,y,l,md,p*2);
	if(md+1<=y) ss+=q2(x,y,md+1,r,p*2+1);
	s2[p]=s2[p*2]+s2[p*2+1];
	return ss;
}
int main(){
    freopen("whz_sequence.in","r",stdin);
    freopen("whz_sequence.out","w",stdout);
    ios::sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    build1(1,n/2,1);
    build2(1,(n+1)/2,1);
    cin>>m;
    while(m--){
        cin>>op>>x>>y;
        if(x%2) xx=xxx=(x+1)/2;
        else xx=x/2,xxx=(x+2)/2;
        if(y%2) yyy=(y+1)/2,yy=(y-1)/2;
        else yy=yyy=y/2;
        if(op==1){
            cin>>z;
            ad1(xx,yy,1,n/2,z,1);
            ad2(xxx,yyy,1,(n+1)/2,z,1);
        }else{
            if(x%2) cout<<q2(xxx,yyy,1,(n+1)/2,1)-q1(xx,yy,1,n/2,1)<<"\n";
            else cout<<q1(xx,yy,1,n/2,1)-q2(xxx,yyy,1,(n+1)/2,1)<<"\n";
        }
    }
    return 0;
}