题目

#include<bits/stdc++.h>
using namespace std;
#define mid (l+r>>1)
const int N=100002,M=3000002;
struct seg{
	int l,r,id;
}a[M];
struct kd{
	int l,r,mn[2],mx[2],sz,p[2];
}b[M];
int q,op,las,A[2],B[2],now,id[N],tot,cnt,tim,k,rt;
inline char gc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
	int x=0,fl=1;char ch=gc();
	for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
	for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
	return x*fl;
}
inline void wri(int a){if(a<0)a=-a,putchar('-');if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(int a){wri(a);puts("");}
bool chk(int *a,int *b){return a[now]<b[now];}
bool cmp(int x,int y){return b[x].p[now]<b[y].p[now];}
void up(int x){
	int l=b[x].l,r=b[x].r;
	b[x].mn[0]=min(b[x].p[0],min(b[l].mn[0],b[r].mn[0]));
	b[x].mx[0]=max(b[x].p[0],max(b[l].mx[0],b[r].mx[0]));
	b[x].mn[1]=min(b[x].p[1],min(b[l].mn[1],b[r].mn[1]));
	b[x].mx[1]=max(b[x].p[1],max(b[l].mx[1],b[r].mx[1]));
	b[x].sz=b[l].sz+b[r].sz+1;
}
int build(int l,int r,bool d){
	now=d,nth_element(id+l,id+mid,id+r+1,cmp);
	if (l<mid) b[id[mid]].l=build(l,mid-1,d^1);
	else b[id[mid]].l=0;
	if (mid<r) b[id[mid]].r=build(mid+1,r,d^1);
	else b[id[mid]].r=0;
	up(id[mid]);
	return id[mid];
}
void dfs(int x){
	if (x) dfs(b[x].l),id[++tot]=x,dfs(b[x].r);
}
void ins(int &x,bool d,bool fl){
	if (!x){
		x=++tim;
		b[x].p[0]=A[0],b[x].p[1]=A[1];
		up(x);
		return;
	}
	bool tag;now=d;
	if (chk(A,b[x].p)) tag=((b[b[x].l].sz+1)*4>(b[x].sz+1)*3),ins(b[x].l,d^1,fl|tag);
	else tag=((b[b[x].r].sz+1)*4>(b[x].sz+1)*3),ins(b[x].r,d^1,fl|tag);
	up(x);
	if (tag && !fl) tot=0,dfs(x),x=build(1,tot,d);
}
void modify(int p,int l,int r,int &x){
	if (!x) x=++cnt;
	ins(a[x].id,0,0);
	if (l==r) return;
	if (p<=mid) modify(p,l,mid,a[x].l);
	else modify(p,mid+1,r,a[x].r);
}
int query(int x){
	if (!x || b[x].mx[0]<A[0] || b[x].mn[0]>B[0] || b[x].mx[1]<A[1] || b[x].mn[1]>B[1]) return 0;
	if (A[0]<=b[x].mn[0] && b[x].mx[0]<=B[0] && A[1]<=b[x].mn[1] && b[x].mx[1]<=B[1]) return b[x].sz;
	return (A[0]<=b[x].p[0] && b[x].p[0]<=B[0] && A[1]<=b[x].p[1] && b[x].p[1]<=B[1])+query(b[x].l)+query(b[x].r);
}
int ask(int p,int l,int r,int x){
	if (l==r) return l;
	int t=query(a[a[x].r].id);
	if (p<=t) return ask(p,mid+1,r,a[x].r);
	return ask(p-t,l,mid,a[x].l);
}
int main(){
	rd(),q=rd();
	b[0].mn[0]=b[0].mn[1]=1e9,b[0].mx[0]=b[0].mx[1]=-1e9;
	for (;q--;){
		op=rd(),A[0]=rd()^las,A[1]=rd()^las;
		if (op==1) k=rd()^las,modify(k,0,1e9,rt);
		else{
			B[0]=rd()^las,B[1]=rd()^las,k=rd()^las;
			if (las=ask(k,0,1e9,rt)) wln(las);
			else puts("NAIVE!ORZzyz.");
		}
	}
}