题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4578
题目大意:给你一个n个元素的数组,4种操作,1:区间+k。2:区间*c 。3:区间修改 4:计算区间p次方和
思路:三个标记,Add,Mul,U。先加后乘:Add标记同时*c,先乘后加:直接+add即可。区间修改,相当于覆盖,更新Add和Mul,刷新U标记。处理好这三个标记之间的关系就可以了。
代码写得比较繁琐,写了很多重复的代码,其实很多都可以用函数代替的。
ACCode:
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<time.h>
#include<math.h>
// srand(unsigned)time(NULL));rand();
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
#define ll long long
#define Pii pair<int,int>
#define clean(a,b) memset(a,b,sizeof(a))
using namespace std;
const int MAXN=1e5+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const ll MOD=10007;
const double PI=acos(-1.0);
const double EPS=1.0e-8;
//unsigned register
// ios::sync_with_stdio(false)
struct SegTree{
struct Node{
int l,r;
ll Sum1,Sum2,Sum3,len;
ll Alazy,Mlazy,Ulazy;
};
Node Tree[MAXN<<2];
void PushUp(int rt){
Tree[rt].Sum1=(1ll*Tree[rt<<1].Sum1+Tree[rt<<1|1].Sum1)%MOD;
Tree[rt].Sum2=(1ll*Tree[rt<<1].Sum2+Tree[rt<<1|1].Sum2)%MOD;
Tree[rt].Sum3=(1ll*Tree[rt<<1].Sum3+Tree[rt<<1|1].Sum3)%MOD;
}
void PushDown(int rt){
if(Tree[rt].Ulazy){
ll val=Tree[rt].Ulazy;
Tree[rt<<1].Ulazy=Tree[rt<<1|1].Ulazy=Tree[rt].Ulazy;//子节点lazy刷新
Tree[rt<<1].Alazy=Tree[rt<<1|1].Alazy=0;
Tree[rt<<1].Mlazy=Tree[rt<<1|1].Mlazy=1;
Tree[rt<<1].Sum1=(1ll*Tree[rt<<1].len*val)%MOD;//左子节点Sum
Tree[rt<<1].Sum2=(1ll*Tree[rt<<1].len*val*val)%MOD;
Tree[rt<<1].Sum3=(1ll*Tree[rt<<1].len*val*val*val)%MOD;
Tree[rt<<1|1].Sum1=(1ll*Tree[rt<<1|1].len*val)%MOD;//右子节点Sum
Tree[rt<<1|1].Sum2=(1ll*Tree[rt<<1|1].len*val*val)%MOD;
Tree[rt<<1|1].Sum3=(1ll*Tree[rt<<1|1].len*val*val*val)%MOD;
Tree[rt].Ulazy=0;
}
if(Tree[rt].Mlazy>1){
ll val=Tree[rt].Mlazy;
Tree[rt<<1].Sum3=(1ll*Tree[rt<<1].Sum3*val*val*val)%MOD;//左子节点Sum
Tree[rt<<1].Sum2=(1ll*Tree[rt<<1].Sum2*val*val)%MOD;
Tree[rt<<1].Sum1=(1ll*Tree[rt<<1].Sum1*val)%MOD;
Tree[rt<<1|1].Sum3=(1ll*Tree[rt<<1|1].Sum3*val*val*val)%MOD;//右子节点Sum
Tree[rt<<1|1].Sum2=(1ll*Tree[rt<<1|1].Sum2*val*val)%MOD;
Tree[rt<<1|1].Sum1=(1ll*Tree[rt<<1|1].Sum1*val)%MOD;
Tree[rt<<1].Mlazy=(1ll*Tree[rt<<1].Mlazy*val)%MOD;//子节点lazy刷新
Tree[rt<<1].Alazy=(1ll*Tree[rt<<1].Alazy*val)%MOD;
Tree[rt<<1|1].Mlazy=(1ll*Tree[rt<<1|1].Mlazy*val)%MOD;
Tree[rt<<1|1].Alazy=(1ll*Tree[rt<<1|1].Alazy*val)%MOD;
Tree[rt].Mlazy=1;
}
if(Tree[rt].Alazy){
ll val=Tree[rt].Alazy;
Tree[rt<<1].Sum3=(1ll*Tree[rt<<1].Sum3+3ll*val*Tree[rt<<1].Sum2+3ll*val*val*Tree[rt<<1].Sum1+Tree[rt<<1].len*val*val*val)%MOD;//左子节点Sum
Tree[rt<<1].Sum2=(1ll*Tree[rt<<1].Sum2+2ll*val*Tree[rt<<1].Sum1+Tree[rt<<1].len*val*val)%MOD;
Tree[rt<<1].Sum1=(1ll*Tree[rt<<1].Sum1+val*Tree[rt<<1].len%MOD)%MOD;
Tree[rt<<1|1].Sum3=(1ll*Tree[rt<<1|1].Sum3+3ll*val*Tree[rt<<1|1].Sum2+3ll*val*val*Tree[rt<<1|1].Sum1+Tree[rt<<1|1].len*val*val*val)%MOD;//右子节点Sum
Tree[rt<<1|1].Sum2=(1ll*Tree[rt<<1|1].Sum2+2ll*val*Tree[rt<<1|1].Sum1+Tree[rt<<1|1].len*val*val)%MOD;
Tree[rt<<1|1].Sum1=(1ll*Tree[rt<<1|1].Sum1+val*Tree[rt<<1|1].len%MOD)%MOD;
Tree[rt<<1].Alazy=(1ll*Tree[rt<<1].Alazy+val)%MOD;//子节点lazy刷新
Tree[rt<<1|1].Alazy=(1ll*Tree[rt<<1|1].Alazy+val)%MOD;
Tree[rt].Alazy=0;
}
}
void Build(int l,int r,int rt,ll A[]){
Tree[rt].l=l;Tree[rt].r=r;Tree[rt].len=r-l+1;
Tree[rt].Alazy=Tree[rt].Ulazy=0;Tree[rt].Mlazy=1;
if(l==r){
Tree[rt].Sum1=Tree[rt].Sum2=Tree[rt].Sum3=0;
return ;
}int mid=(l+r)>>1;
Build(l,mid,rt<<1,A);Build(mid+1,r,rt<<1|1,A);
PushUp(rt);
}
void AddUpdate(int ql,int qr,ll val,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr){
Tree[rt].Sum3=(1ll*Tree[rt].Sum3+3*val*Tree[rt].Sum2+3ll*val*val*Tree[rt].Sum1+Tree[rt].len*val*val*val)%MOD;
Tree[rt].Sum2=(1ll*Tree[rt].Sum2+2*val*Tree[rt].Sum1+Tree[rt].len*val*val)%MOD;
Tree[rt].Sum1=(1ll*Tree[rt].Sum1+val*Tree[rt].len%MOD)%MOD;
Tree[rt].Alazy=(1ll*Tree[rt].Alazy+val)%MOD;
//Tree[rt].Ulazy=0;
return ;
}PushDown(rt);
if(ql>=Tree[rt<<1|1].l) AddUpdate(ql,qr,val,rt<<1|1);
else if(qr<=Tree[rt<<1].r) AddUpdate(ql,qr,val,rt<<1);
else{
AddUpdate(ql,qr,val,rt<<1);
AddUpdate(ql,qr,val,rt<<1|1);
}PushUp(rt);
}
void MulUpdate(int ql,int qr,ll val,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr){
Tree[rt].Sum3=(1ll*Tree[rt].Sum3*val*val*val)%MOD;
Tree[rt].Sum2=(1ll*Tree[rt].Sum2*val*val)%MOD;
Tree[rt].Sum1=(1ll*Tree[rt].Sum1*val)%MOD;
Tree[rt].Mlazy=(1ll*Tree[rt].Mlazy*val)%MOD;
Tree[rt].Alazy=(1ll*Tree[rt].Alazy*val)%MOD;//之前就有Add
//Tree[rt].Ulazy=0;
return ;
}PushDown(rt);
if(ql>=Tree[rt<<1|1].l) MulUpdate(ql,qr,val,rt<<1|1);
else if(qr<=Tree[rt<<1].r) MulUpdate(ql,qr,val,rt<<1);
else{
MulUpdate(ql,qr,val,rt<<1);
MulUpdate(ql,qr,val,rt<<1|1);
}PushUp(rt);
}
void Update(int ql,int qr,ll val,int rt){
//printf("Update :%d\n",rt);
if(ql<=Tree[rt].l&&Tree[rt].r<=qr){
Tree[rt].Sum1=1ll*Tree[rt].len*val%MOD;
Tree[rt].Sum2=1ll*Tree[rt].len*val*val%MOD;
Tree[rt].Sum3=1ll*Tree[rt].len*val*val*val%MOD;
//printf("val=%lld l=%d r=%d Sum1=%lld Sum2=%lld Sum3=%lld\n",val,Tree[rt].l,Tree[rt].r,Tree[rt].Sum1,Tree[rt].Sum2,Tree[rt].Sum3);
Tree[rt].Ulazy=val;
Tree[rt].Alazy=0;Tree[rt].Mlazy=1;
return ;
}PushDown(rt);
if(ql>=Tree[rt<<1|1].l) Update(ql,qr,val,rt<<1|1);
else if(qr<=Tree[rt<<1].r) Update(ql,qr,val,rt<<1);
else{
Update(ql,qr,val,rt<<1);
Update(ql,qr,val,rt<<1|1);
}PushUp(rt);
}
ll Query(int ql,int qr,int opt,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr){
if(opt==1) return Tree[rt].Sum1;
else if(opt==2) return Tree[rt].Sum2;
else return Tree[rt].Sum3;
}PushDown(rt);
ll Ans;
if(ql>=Tree[rt<<1|1].l) Ans=Query(ql,qr,opt,rt<<1|1);
else if(qr<=Tree[rt<<1].r) Ans=Query(ql,qr,opt,rt<<1);
else Ans=Query(ql,qr,opt,rt<<1)+Query(ql,qr,opt,rt<<1|1);
PushUp(rt);
return Ans%MOD;
}
void Show(int rt){
printf("l=%d r=%d Sum1=%lld Sum2=%lld Sum3=%lld\n",Tree[rt].l,Tree[rt].r,Tree[rt].Sum1,Tree[rt].Sum2,Tree[rt].Sum3);
if(Tree[rt].l==Tree[rt].r) return ;
Show(rt<<1);Show(rt<<1|1);
}
};
SegTree Seg;
ll A[MAXN];
int n,m;
int main(){
while(~scanf("%d%d",&n,&m)){
if(n==0&&m==0) break;
//for(int i=1;i<=n;++i) scanf("%lld",&A[i]);
Seg.Build(1,n,1,A);//Seg.Show(1);
while(m--){
int opt,l,r,val;scanf("%d%d%d%d",&opt,&l,&r,&val);
if(opt==1) Seg.AddUpdate(l,r,val,1);//Add x
else if(opt==2) Seg.MulUpdate(l,r,val,1);//Mul x
else if(opt==3) Seg.Update(l,r,val,1);//Update x
else{//Query Sum^p
if(val==1) printf("%lld\n",Seg.Query(l,r,1,1));
else if(val==2) printf("%lld\n",Seg.Query(l,r,2,1));
else printf("%lld\n",Seg.Query(l,r,3,1));
}//Seg.Show(1);puts("");
}
}
}