bzoj 4066: 简单题

 #include<cstdio>
 #include<iostream>
 #include<cstdlib>
 #include<algorithm>
 #define M 200009
 #define inf 100000000
 #define ll long long
 using namespace std;
 struct A
 {
     int l,r,mn[],mx[],d[],v;
     ll sum;
 }a[M],b,p[M];
 int n,m,root,N,tot;
 ll lans;
 void updata(int k)
 {
     A l1=a[a[k].l],r1=a[a[k].r];
     for(int i=;i<;i++)
       {
         a[k].mn[i]=a[k].mx[i]=a[k].d[i];
         if(a[k].l)
           a[k].mn[i]=min(a[k].mn[i],l1.mn[i]),a[k].mx[i]=max(a[k].mx[i],l1.mx[i]);
         if(a[k].r)
           a[k].mn[i]=min(a[k].mn[i],r1.mn[i]),a[k].mx[i]=max(a[k].mx[i],r1.mx[i]);
       }
     a[k].sum=l1.sum+r1.sum+(ll)a[k].v;
     return;
 }
 bool cmp(A a1,A a2)
 {
     return a1.d[N]<a2.d[N];
 }
 int rebuild(int l1,int r1,int now)
 {
     N=now;
     int mid=(l1+r1)>>;
     nth_element(p+l1,p+mid,p+r1+,cmp);
     a[mid]=p[mid];
     if(l1<mid)
       a[mid].l=rebuild(l1,mid-,now^);
     else
       a[mid].l=;
     if(r1>mid)
       a[mid].r=rebuild(mid+,r1,now^);
     else
       a[mid].r=;
     updata(mid);
     return mid;
 }
 void cha(int &k,A b,int now)
 {
     if(!k)
       {
         k=++m;
         for(int i=;i<;i++)
           a[k].mn[i]=a[k].mx[i]=a[k].d[i]=b.d[i];
         a[k].l=a[k].r=;
       }
     if(a[k].d[]==b.d[]&&a[k].d[]==b.d[])
       {
         a[k].v+=b.v;
         a[k].sum+=b.v;
         return;
       }
     if(a[k].d[now]>b.d[now])
       cha(a[k].l,b,now^);
     else
       cha(a[k].r,b,now^);
     updata(k);
 }
 ll zhao(int k,int x1,int y1,int x2,int y2)
 {
     if(a[k].mn[]>=x1&&a[k].mn[]>=y1&&a[k].mx[]<=x2&&a[k].mx[]<=y2)
       return a[k].sum;
     if(a[k].mn[]>x2||a[k].mn[]>y2||a[k].mx[]<x1||a[k].mx[]<y1)
       return ;
     ll tmp=;
     if(a[k].d[]>=x1&&a[k].d[]>=y1&&a[k].d[]<=x2&&a[k].d[]<=y2)
       tmp+=a[k].v;
     return tmp+zhao(a[k].l,x1,y1,x2,y2)+zhao(a[k].r,x1,y1,x2,y2);
 }

 ll read()
 {
     ll x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int main()
 {
     n=read();
     tot=;
     for(;;)
       {
         int a1,a2,a3,a4;
         a1=read();
         if(a1==)
           return ;
         a2=read()^lans;
         a3=read()^lans;
         a4=read()^lans;
         if(a1==)
           {
             b.d[]=a2;
             b.d[]=a3;
             b.v=a4;
             cha(root,b,);
             if(m==tot)
               {
                 for(int i=;i<=m;i++)
                   p[i]=a[i];
                 root=rebuild(,m,);
                 tot+=;
               }
           }
         else
           {
             int a5;
             a5=read()^lans;
             printf("%lld\n",lans=zhao(root,a2,a3,a4,a5));
           }
       }
     return ;
 }

KDtree