[ KD-tree ] BZOJ4066

裸题

#include<bits/stdc++.h>
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void Read(int& x){
    char c=nc();
    for(;c<'0'||c>'9';c=nc());
    for(x=0;c>='0'&&c<='9';x=(x<<3)+(x<<1)+c-48,c=nc());
}
const int N=200010;
const double RR=0.6;
struct Node{
    int v[2],mx[2],mn[2],w,sum;
    int l,r,s;
    bool operator == (Node x){
        for(int i=0;i<2;i++)
        if(v[i]!=x.v[i])return 0;
        return 1;
    }
    inline void Init(){
        sum=w;s=1;
        mx[0]=mn[0]=v[0];mx[1]=mn[1]=v[1];
        l=r=0;
    }
}a[N];
int k,n,m,p,cnt;
int Rt;
int L[2],R[2];
int st[N],top;
int x,y,z;
int Ans;
bool cur;
namespace KDT{
    void Up(int x){
        a[x].s=1;a[x].sum=a[x].w;
        if(a[x].l)a[x].s+=a[a[x].l].s,a[x].sum+=a[a[x].l].sum;
        if(a[x].r)a[x].s+=a[a[x].r].s,a[x].sum+=a[a[x].r].sum;
        for(int i=0;i<2;i++){
            a[x].mn[i]=a[x].mx[i]=a[x].v[i];
            if(a[x].l){
                a[x].mx[i]=max(a[x].mx[i],a[a[x].l].mx[i]);
                a[x].mn[i]=min(a[x].mn[i],a[a[x].l].mn[i]);
            }
            if(a[x].r){
                a[x].mx[i]=max(a[x].mx[i],a[a[x].r].mx[i]);
                a[x].mn[i]=min(a[x].mn[i],a[a[x].r].mn[i]);
            }
        }
    }
    bool Cmp(Node x,Node y){
        return x.v[cur]<y.v[cur];
    }
    void Dfs(int x){
        st[++top]=x;
        if(a[x].l)Dfs(a[x].l);
        if(a[x].r)Dfs(a[x].r);
    }
    inline bool Cmp2(int x,int y){
        return a[x].v[cur]<a[y].v[cur];
    }
    int reBuild(int l,int r,bool d){
        if(l>r)return 0;
        int Mid=l+r>>1;
        cur=d;
        nth_element(st+l,st+Mid,st+r+1,Cmp2);
        int x=st[Mid];
        a[x].l=reBuild(l,Mid-1,d^1);
        a[x].r=reBuild(Mid+1,r,d^1);
        Up(x);
        return x;
    }
    int Insert(int x,bool d){
        if(!x){
            a[++cnt]=a[0];
            return cnt;
        }
        if(a[x]==a[0]){
            a[x].w+=a[0].w;a[x].sum+=a[0].w;
            return x;
        }
        if(a[x].v[d]>a[0].v[d])a[x].l=Insert(a[x].l,d^1);else a[x].r=Insert(a[x].r,d^1);
        Up(x);
        if(a[a[x].l].s>RR*a[x].s||a[a[x].r].s>RR*a[x].s){
            top=0;Dfs(x);
            x=reBuild(1,top,d);
        }
        return x;
    }
    inline bool pd(int x){
        if(!x)return 0;
        for(int i=0;i<2;i++)
        if(a[x].mn[i]>R[i]||a[x].mx[i]<L[i])return 0;
        return 1;
    }
    inline bool Check(int x){
        for(int i=0;i<2;i++)
        if(a[x].mn[i]<L[i]||a[x].mx[i]>R[i])return 0;
        return 1;
    }
    void Query(int x){
        if(!pd(x))return;
        if(Check(x)){
            Ans+=a[x].sum;
            return;
        }
        if(a[x].v[0]>=L[0]&&a[x].v[0]<=R[0]&&a[x].v[1]>=L[1]&&a[x].v[1]<=R[1])Ans+=a[x].w;
        Query(a[x].l);Query(a[x].r);
    }
}
int main(){
    Read(n);
    while(1){
        Read(k);
        if(k==3)break;
        if(k==1){
            Read(x);Read(y);Read(z);
            x^=Ans;y^=Ans;z^=Ans;
            a[0].v[0]=x;a[0].v[1]=y;a[0].w=z;
            a[0].Init();
            Rt=KDT::Insert(Rt,0);
        }else{
            Read(L[0]),Read(L[1]);Read(R[0]);Read(R[1]);
            L[0]^=Ans,R[0]^=Ans;L[1]^=Ans;R[1]^=Ans;
            Ans=0;KDT::Query(Rt);
            printf("%d\n",Ans);
        }
    }
    return 0;
}