有没有帮忙看一下二维线段树的吖 哭哭

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
template<typename sp>
inline void qread(sp &x){
	char ch=getchar(),lst=' ';
	while(ch<'0'||ch>'9') lst=ch,ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	if(lst=='-') x=-x;
}
long long d[3000<<4],b[3000<<4];
int n,m;
char what;
inline long long pushup(int p){
	d[p]=d[(p<<2)-2]+d[(p<<2)-1]+d[p<<2]+d[(p<<2)|1];
}
inline void pushdown(int sx,int sy,int tx,int ty,int p){
	int midx=(sx+ty)>>1,midy=(sy+ty)>>1;
	d[(p<<2)-2]+=(midy-sy+1)*(midx-sx+1)*b[p];
	d[(p<<2)-1]+=(ty-midy)*(midx-sx+1)*b[p];
	d[p<<2]+=(midy-sy+1)*(tx-midx)*b[p];
	d[(p<<2)|1]+=(ty-midy)*(tx-midx)*b[p];
	b[(p<<2)-2]=b[(p<<2)-1]=b[p<<2]=b[(p<<2)|1]=b[p];
	b[p]=0;
}
inline void update(int lx,int ly,int rx,int ry,int c,int sx,int sy,int tx,int ty,int p){
	if(lx<=sx&&tx<=rx&&ly<=sy&&ty<=ry){
		d[p]+=(tx-sx+1)*(ty-sy+1)*c;
		b[p]+=c;
		return;
	}
	if(b[p]) pushdown(sx,sy,tx,ty,p);
	int midx=(sx+tx)>>1,midy=(sy+ty)>>1;
	if(ly<=midy&&lx<=midx) update(lx,ly,rx,ty,c,sx,sy,midx,midy,(p<<2)-2);
	if(ly>midy&&lx<=midx) update(lx,ly,rx,ty,c,sx,midy+1,midx,ty,(p<<2)-1);
	if(ly<=midy&&lx>midx) update(lx,ly,rx,ty,c,midx+1,sy,tx,midy,p<<2);
	if(ly>midy&&lx>midx) update(lx,ly,rx,ty,c,midx+1,midy+1,tx,ty,(p<<2)|1);
	pushup(p);
}
inline int getans(int lx,int ly,int rx,int ry,int sx,int sy,int tx,int ty,int p){
	if(lx<=sx&&tx<=rx&&ly<=sy&&ty<=ry){
		return d[p];
	}
	if(b[p]) pushdown(sx,sy,tx,ty,p);
	int midx=(sx+tx)>>1,midy=(sy+ty)>>1;
	int ans=0;
	if(ly<=midy&&lx<=midx) ans+=getans(lx,ly,rx,ty,sx,sy,midx,midy,(p<<2)-2);
	if(ly>midy&&lx<=midx) ans+=getans(lx,ly,rx,ty,sx,midy+1,midx,ty,(p<<2)-1);
	if(ly<=midy&&lx>midx) ans+=getans(lx,ly,rx,ty,midx+1,sy,tx,midy,p<<2);
	if(ly>midy&&lx>midx) ans+=getans(lx,ly,rx,ty,midx+1,midy+1,tx,ty,(p<<2)|1);
	return ans;
}
int main(){
	char opt[15];
	std::cin>>what;
	qread(n);qread(m);
	while(~scanf("%s",opt)){
		int x1=0,y1=0,x2=0,y2=0,del=0;
		qread(x1);qread(y1);qread(x2);qread(y2);
		if(opt[0]=='L'){
			qread(del);
			update(x1,y1,x2,y2,del,1,1,n,m,1);
		}
		if(opt[0]=='k') printf("%lld",getans(x1,y1,x2,y2,1,1,n,m,1));
	}
	return 0;
}