BZOJ1176: [Balkan2007]Mokia【CDQ+树状数组】

1176: [Balkan2007]Mokia

将询问分成四部分，然后CDQ分治+树状数组就可以了，三个关键字为{t,x,y}

#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=200005;
struct xcw{int x,y,f,t,p;}a[MAXN],t[MAXN];
#include<cctype>
int read(){
	int ret=0;char ch=getchar();bool f=1;
	for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
	for(; isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;
	return f?ret:-ret;
}
int m,n,s,tot,Ans[MAXN],F[2000005];bool vis[MAXN];
void put(int x,int p){for(;x<=m;x+=x&-x) F[x]+=p;}
int get(int x){int Sum=0;for(;x;x-=x&-x) Sum+=F[x];return Sum;}
void Solve(int L,int R){
	if(L==R) return;int mid=(R+L)>>1;
	Solve(L,mid);Solve(mid+1,R);
	int i=L,j=mid+1,p=L-1;
	while(i<=mid||j<=R){
		if(j>R||(i<=mid&&a[i].x<=a[j].x)){t[++p]=a[i];if(a[i].f==0) put(a[i].y,a[i].p);i++;}
		else{t[++p]=a[j];if(a[j].f!=0) Ans[a[j].t]+=a[j].f*get(a[j].y);j++;}
	}
	for(int i=L;i<=mid;i++) if(a[i].f==0) put(a[i].y,-a[i].p);
	for(int i=L;i<=R;i++) a[i]=t[i];
}
int main(){
	s=read(),m=read();int Type;
	for(n=1;(Type=read())!=3;n++)
	if(Type==1) a[++tot]=(xcw){read(),read(),0,n,read()};
	else{
		vis[n]=1;int x=read(),y=read(),_x=read(),_y=read();
		a[++tot]=(xcw){_x,_y,1,n,0};a[++tot]=(xcw){_x,y-1,-1,n,0};
		a[++tot]=(xcw){x-1,_y,-1,n,0};a[++tot]=(xcw){x-1,y-1,1,n,0};
		Ans[n]=(_x-x+1)*(_y-y+1)*s;
	}
	n--;Solve(1,tot);
	for(int i=1;i<=n;i++) if(vis[i]) printf("%d\n",Ans[i]);
	return 0;
}