[权值线段树套kd树 替罪羊式重构] BZOJ 4605 崂山白花蛇草水

就是个树套树

就是claris的剪枝好神ORZ

#include<cstdio>#include<cstdlib>#include<cmath>#include<algorithm>using namespace std;typedef long long ll; inline char nc(){static char buf[100000],*p1=buf,*p2=buf;if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }return *p1++;} inline void read(int &x){char c=nc(),b=1;for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;}const double A=0.8;const int N=100005,M=1600010;int Q,x,y,v;int ix1,ix2,iy1,iy2,K; int D;struct node{int d[2],mx[2],mn[2],l,r,sum;node() { }node(int x,int y) { mx[0]=mn[0]=d[0]=x; mx[1]=mn[1]=d[1]=y; l=r=0; sum=0; }int& operator[](int x) { return d[x]; }friend bool operator == (const node &A, const node &B) { return A.d[0]==B.d[0] && A.d[1]==B.d[1]; }friend bool operator < (const node &A,const node &B) { return A.d[D]<B.d[D]; }};int tmp[N],ttot,dep[N],deep;inline bool inside(int x1,int y1,int x2,int y2,int X1,int Y1,int X2,int Y2){return X1<=x1 && x2<=X2 && Y1<=y1 && y2<=Y2;}inline bool outside(int x1,int y1,int x2,int y2,int X1,int Y1,int X2,int Y2){return x2<X1 || x1>X2 || y1>Y2 || y2<Y1;}node T[M],now;int root[M],ncnt;void update(int x){int l=T[x].l,r=T[x].r; for(int i=0;i<2;i++) { T[x].mn[i]=T[x].mx[i]=T[x][i]; if(l) T[x].mn[i]=min(T[x].mn[i],T[l].mn[i]),T[x].mx[i]=max(T[x].mx[i],T[l].mx[i]); if(r) T[x].mn[i]=min(T[x].mn[i],T[r].mn[i]),T[x].mx[i]=max(T[x].mx[i],T[r].mx[i]); }T[x].sum=T[l].sum+T[r].sum+1; } bool cmp(int a,int b){return T[a]<T[b];}int Reb(int l,int r,int D){ if (l>r) return 0; int mid=(l+r)>>1; ::D=D; nth_element(tmp+l,tmp+mid,tmp+r+1,cmp);int x=tmp[mid];T[x].mn[0]=T[x].mx[0]=T[x][0];T[x].mn[1]=T[x].mx[1]=T[x][1];T[x].l=Reb(l,mid-1,D^1); T[x].r=Reb(mid+1,r,D^1); update(x); return x; }void Cpy(int x){if (x) { tmp[++ttot]=x,Cpy(T[x].l),Cpy(T[x].r); }}void iIns(int &x,int D){if (!x){ T[x=++ncnt]=now; dep[++deep]=x; return; }dep[++deep]=x;if (now[D]<T[x][D]) iIns(T[x].l,D^1); else iIns(T[x].r,D^1); update(x); }void Ins(int &x){if (!x){ T[x=++ncnt]=now; return; }deep=0; iIns(x,0);if(deep<log(T[x].sum)/log(1/A)) return;int cur=dep[deep];  while (cur && (double)T[T[cur].l].sum<A*T[cur].sum && (double)T[T[cur].r].sum<A*T[cur].sum) cur=dep[--deep];  if(!cur)return;  if (cur==x){    ttot=0,Cpy(x);    x=Reb(1,ttot,0);    return;  }  int y=dep[--deep];  ttot=0,Cpy(cur);  int k=Reb(1,ttot,deep&1);  if(T[y].l==cur) T[y].l=k; else T[y].r=k;}int ans,X1,X2,Y1,Y2;void iQuery(int x){ if (!x || ans>=K) return; if (outside(T[x].mn[0],T[x].mn[1],T[x].mx[0],T[x].mx[1],X1,Y1,X2,Y2)) return; if (inside(T[x].mn[0],T[x].mn[1],T[x].mx[0],T[x].mx[1],X1,Y1,X2,Y2))  { ans+=T[x].sum; return; } if (inside(T[x][0],T[x][1],T[x][0],T[x][1],X1,Y1,X2,Y2)) ans++; iQuery(T[x].l); iQuery(T[x].r); } int Query(int x,int _X1,int _Y1,int _X2,int _Y2){ans=0; X1=_X1; X2=_X2; Y1=_Y1; Y2=_Y2;iQuery(x);return ans;}  int rot[M],ls[M],rs[M],nd; void Add(int &rt,int l,int r,int f=1){if (!rt) rt=++nd;if (f) Ins(root[rt]);if (l==r) return;int mid=(l+r)>>1;if (v<=mid)Add(ls[rt],l,mid,0);elseAdd(rs[rt],mid+1,r,1);} int Ans(int rt,int l,int r){while (l!=r){if (l==r) return l;int tem=Query(root[rs[rt]],ix1,iy1,ix2,iy2),mid=(l+r)>>1;if (K<=tem)rt=rs[rt],l=mid+1;elseK-=tem,rt=ls[rt],r=mid;}return l;} int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);int order,lastans=0;read(Q); read(Q);while (Q--){read(order);if (order==1){read(x); read(y); read(v);//x^=lastans; y^=lastans; v^=lastans;now=node(x,y); now.sum=1;Add(rot[1],1,(int)1e9);}else{read(ix1); read(iy1); read(ix2); read(iy2); read(K);//ix1^=lastans; iy1^=lastans; ix2^=lastans; iy2^=lastans; K^=lastans;if (Query(root[rot[1]],ix1,iy1,ix2,iy2)<K)lastans=0;elselastans=Ans(rot[1],1,(int)1e9);if (!lastans)printf("NAIVE!ORZzyz.\n");elseprintf("%d\n",lastans);}}return 0;}