bzoj 1176: [Balkan2007]Mokia

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
struct node{
int op,a,b,c;
}q[800010],tmp[800010];
struct NODE{
int a,c;
}Q[800010];
int s,n,cnt=0,qcnt=0,tr[2000010],ans[200010];
int lowbit(int x) {return x&(-x);}
void change(int k,int c) {for(int i=k;i<=n;i+=lowbit(i)) tr[i]+=c;}
int get(int k) {int ans=0;for(int i=k;i>=1;i-=lowbit(i)) ans+=tr[i];return ans;}
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void solve(int &x,int &y,int &X,int &Y)
{
if(x>X) swap(x,X);
if(y>Y) swap(y,Y);
}
void cdq(int l,int r)
{
if(l==r) return;
int mid=(l+r)/2;
cdq(l,mid);cdq(mid+1,r);
int i=l,j=mid+1,len=0,st=0;
while(i<=mid&&j<=r)
{
if(q[i].a<=q[j].a)
{
if(q[i].op==1) change(q[i].b,q[i].c),Q[++st].a=q[i].b,Q[st].c=q[i].c;
tmp[++len]=q[i++];
}
else
{
if(q[j].op==2) ans[q[j].c]+=get(q[j].b);
if(q[j].op==3) ans[q[j].c]-=get(q[j].b);
tmp[++len]=q[j++];
}
}
while(i<=mid) tmp[++len]=q[i++];
while(j<=r)
{
if(q[j].op==2) ans[q[j].c]+=get(q[j].b);
if(q[j].op==3) ans[q[j].c]-=get(q[j].b);
tmp[++len]=q[j++];
}
for(i=1;i<=len;i++) q[l+i-1]=tmp[i];
if(l==1&&r==cnt) return;
for(int i=1;i<=st;i++) change(Q[i].a,-Q[i].c);
}
int main()
{
s=read();n=read();
int op;
while(scanf("%d",&op),op!=3)
{
if(op==1)
{
int x,y,c;x=read();y=read();c=read();
q[++cnt].op=1;q[cnt].a=x;q[cnt].b=y;q[cnt].c=c;
}
else
{
int x,y,X,Y;x=read();y=read();X=read();Y=read();
solve(x,y,X,Y);
q[++cnt].op=2;q[cnt].a=X;q[cnt].b=Y;q[cnt].c=++qcnt;
q[++cnt].op=3;q[cnt].a=x-1;q[cnt].b=Y;q[cnt].c=qcnt;
q[++cnt].op=3;q[cnt].a=X;q[cnt].b=y-1;q[cnt].c=qcnt;
q[++cnt].op=2;q[cnt].a=x-1;q[cnt].b=y-1;q[cnt].c=qcnt;
ans[qcnt]=(X-x+1)*(Y-y+1)*s;
}
}
cdq(1,cnt);
for(int i=1;i<=qcnt;i++) printf("%d\n",ans[i]);
}