bzoj2683

自己的方法写的有点长

#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int N=500005;

int n,m;

struct query
{
	int x,y,xx,yy;
	int id,ans;
}Q[N];

queue<int> q1,q2;

int tmp[N];

inline int lowbit(int x){return x&(-x);}
int t[N];
void add(int i,int val,int k)
{
	if (k!=-1) q1.push(i),q2.push(val);
	for (;i<=m;i+=lowbit(i)) t[i]+=val;
}
int sum(int i)
{
	int ans=0;
	while (i)
	{
		ans+=t[i];
		i-=lowbit(i);
	}
	return ans;
}

int cnt;
struct aaa
{
	int pos,id,from,val,x,down,up;
	bool operator <(const aaa &b)const 
	{
		if (pos==b.pos) return id<b.id;
		return pos<b.pos;
	}
}kk[N];


void work()
{
	int w;
	cnt=0;
	for (int i=1;i<=tmp[0];i++) 
	switch(Q[w=tmp[i]].id)
	{
		case 1:
			++cnt;
			kk[cnt].id=1;
			kk[cnt].from=w;
			kk[cnt].pos=Q[w].y;
			kk[cnt].val=Q[w].xx;
			kk[cnt].x=Q[w].x;
		break;
		case 2:
			++cnt;
			kk[cnt].id=2;
			kk[cnt].from=w;
			kk[cnt].pos=Q[w].y-1;
			kk[cnt].up=Q[w].x-1;
			kk[cnt].down=Q[w].xx;
			
			++cnt;
			kk[cnt].id=3;
			kk[cnt].from=w;
			kk[cnt].pos=Q[w].yy;
			kk[cnt].up=Q[w].x-1;
			kk[cnt].down=Q[w].xx;
		break;
	}
	
	sort(kk+1,kk+cnt+1);
	
	for (int i=1;i<=cnt;i++)
	{
		int kkk=kk[i].id;
		switch(kk[i].id)
		{
			case 1:
				add(kk[i].x,kk[i].val,0);
			break;
			case 2:
				int from=kk[i].from;
				Q[from].ans-=sum(kk[i].down)-sum(kk[i].up);
			break;
		}
		if (kkk==3)
		{
			int from=kk[i].from;
			Q[from].ans+=sum(kk[i].down)-sum(kk[i].up);
		}
	}
	while (!q1.empty()) add(q1.front(),-q2.front(),-1),q1.pop(),q2.pop();
}


void work(int l,int r)
{
	if (l==r) return ;
	int mid=(l+r)>>1;
	tmp[0]=0;
	for (int i=l;i<=mid;i++) if (Q[i].id==1) tmp[++tmp[0]]=i;
	for (int i=mid+1;i<=r;i++) if (Q[i].id==2) tmp[++tmp[0]]=i;
	
	work();
	
	work(l,mid);
	work(mid+1,r);
}

int main()
{
	scanf("%d",&m);m++;
	while (true)
	{
		n++;
		scanf("%d",&Q[n].id);
		switch(Q[n].id)
		{
			case 1:
				scanf("%d%d%d",&Q[n].x,&Q[n].y,&Q[n].xx);
				break;
			case 2:
				scanf("%d%d%d%d",&Q[n].x,&Q[n].y,&Q[n].xx,&Q[n].yy);
				break;
		}
		if (Q[n].id==3) break;
	}
	n--;
	work(1,n);
	for (int i=1;i<=n;i++) if (Q[i].id==2) printf("%d\n",Q[i].ans);
	return 0;
}