洛谷P4148 简单题

题目链接

 

题解：k-d tree模板题。重构树那块挺奇怪的。

 

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct aaa{
	int d[2],x;
}a[200001];
struct bbb{
	int l,r,mx[2],mn[2],d[2],x,sum;
}tr[200001];
int D,rt,n,m,lastans;
bool operator<(aaa a, aaa b){return a.d[D]<b.d[D];}
void update(int x){
	int i;
	tr[x].sum=tr[tr[x].l].sum+tr[tr[x].r].sum+tr[x].x;
	for(i=0;i<=1;i++){
		tr[x].mn[i]=tr[x].mx[i]=tr[x].d[i];
		if(tr[x].l){
			tr[x].mx[i]=max(tr[x].mx[i],tr[tr[x].l].mx[i]);
			tr[x].mn[i]=min(tr[x].mn[i],tr[tr[x].l].mn[i]);
		}
		if(tr[x].r){
			tr[x].mx[i]=max(tr[x].mx[i],tr[tr[x].r].mx[i]);
			tr[x].mn[i]=min(tr[x].mn[i],tr[tr[x].r].mn[i]);
		}
	}
}
void ins(int i,int x,int y,int z,int now,int fa,int p){
	if(!i){
		tr[++rt].d[0]=x;tr[rt].d[1]=y;tr[rt].x=z;update(rt);
		if(!p)tr[fa].l=rt;else tr[fa].r=rt;
		return;
	}
	if(tr[i].d[0]==x&&tr[i].d[1]==y){
		tr[i].x+=z;tr[i].sum+=z;return;
	}
	if(!now){
		if(x<=tr[i].d[0])ins(tr[i].l,x,y,z,now^1,i,0);
		 else ins(tr[i].r,x,y,z,now^1,i,1);
	}
	 else if(y<=tr[i].d[1])ins(tr[i].l,x,y,z,now^1,i,0);
		 else ins(tr[i].r,x,y,z,now^1,i,1);
	update(i);	 
}
void rebuild(int l,int r,int now){
	tr[rt].l=tr[rt].r=0;
	int mid=(l+r)/2;
	D=now;
	nth_element(a+l,a+mid,a+r+1);
	tr[rt].d[0]=a[mid].d[0];tr[rt].d[1]=a[mid].d[1];tr[rt].x=a[mid].x;
	int k=rt;
	if(l<mid){
		rt++;tr[k].l=rt;rebuild(l,mid-1,now^1);
	}
	if(mid<r){
		rt++;tr[k].r=rt;rebuild(mid+1,r,now^1);
	}
	update(k);
}
int in(int x1,int x2,int y1,int y2,int x3,int x4,int y3,int y4){
	return(x3<=x1&&x2<=x4&&y3<=y1&&y2<=y4);
}
int out(int x1,int x2,int y1,int y2,int x3,int x4,int y3,int y4){
	return x2<x3||x4<x1||y2<y3||y4<y1;
}
void query(int i,int x1,int y1,int x2,int y2){
	if(!i)return;
	if(in(tr[i].mn[0],tr[i].mx[0],tr[i].mn[1],tr[i].mx[1],x1,x2,y1,y2)){
		lastans+=tr[i].sum;return;
	}
	if(out(tr[i].mn[0],tr[i].mx[0],tr[i].mn[1],tr[i].mx[1],x1,x2,y1,y2))return;
	if(in(tr[i].d[0],tr[i].d[0],tr[i].d[1],tr[i].d[1],x1,x2,y1,y2))lastans+=tr[i].x;
	query(tr[i].l,x1,y1,x2,y2);
	query(tr[i].r,x1,y1,x2,y2);
}
int main(){
	int N,x,y,x2,y2,t1,t;
	scanf("%d",&N);
	while(~scanf("%d",&t1)){
		if(t1==3)return 0;
		scanf("%d%d",&x,&y);
		if(t1==1){
			scanf("%d",&t);
			n++;a[n].d[0]=x^lastans;a[n].d[1]=y^lastans;a[n].x=t^lastans;
			if(!rt){
				rt++;tr[rt].l=tr[rt].r=0;
				tr[rt].d[0]=a[n].d[0];tr[rt].d[1]=a[n].d[1];tr[rt].x=a[n].x;
				update(rt);
			}
			 else ins(1,a[n].d[0],a[n].d[1],a[n].x,0,0,0);
			if(n==m){
				rt=1;rebuild(1,n,0);
				m+=10000;
			}
		}
		if(t1==2){
			scanf("%d%d",&x2,&y2);
			x^=lastans;y^=lastans;x2^=lastans;y2^=lastans;
			lastans=0;
			query(1,x,y,x2,y2);
			printf("%d\n",lastans);
		}
	}
}