【BZOJ】【P3110】【ZJOI2013】【K大数查询】【题解】【树套树】

传送门：http://www.lydsy.com:808/JudgeOnline/problem.php?id=3110

写了一下午+一晚上还没A啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊

修改log^2n查询log^3n T成翔啊啊啊啊啊啊啊啊啊啊啊啊啊

眼看队友线段树树状数组随便虐啊啊啊啊啊啊啊啊啊啊啊啊

自己的线段树套平衡树 T成翔啊啊啊啊啊啊啊啊啊啊啊啊啊

Code：

#include<cstdio>
#include<cctype>
#include<climits>
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
using namespace std;
typedef long long LL;
const int maxn=50001;
int getint(){  
    int res=0;char ch=getchar();  
    while(!isdigit(ch))ch=getchar();  
    while(isdigit(ch))res=(res<<3)+(res<<1)+(ch-'0'),ch=getchar();   
    return res;  
}  
int n,m;
int rnd(){
	static int KEY=978654321;
	return KEY+=KEY<<2|1;
}
int maxx=0;
struct node;
struct node{
	int val,key,size,s;
	node *c[2];
	void set(int _val=0,int _key=rnd(),int _size=1,int _s=1,node *C=NULL){
		val=_val;key=_key;size=_size;s=_s;c[0]=c[1]=C;
	}
	void rz(){
		size=c[0]->size+s+c[1]->size;
	}
};
node pool[maxn*65];
node *newnode(){
	static int tot=0;
	if(tot<maxn*65)return &pool[tot++];
	return new node();
}
struct Treap{
	node *root,*Null;
	Treap(){
		Null=newnode();
		Null->set(0,INT_MAX,0,0,Null);	
		root=Null;
	}
	void rot(node *&t,bool d){
		node *p=t->c[d];t->c[d]=p->c[!d];
		p->c[!d]=t;t->rz();p->rz();t=p;
	}
	void _insert(node *&t,int x,int siz){
		if(t==Null){t=newnode();t->set(x,rnd(),siz,siz,Null);return;}
		if(t->val==x){t->size+=siz;t->s+=siz;return;}
		_insert(t->c[x>t->val],x,siz);
		if(t->c[x>t->val]->key<t->key)rot(t,x>t->val);
		else t->rz();
	}
	int _find(node *t,int &x){
		if(t==Null)return 0;
		if(t->val==x)return t->s;
		return _find(t->c[x>t->val],x);
	}
    int _rank(node *t,int &x){  
    	int res=0,s;
    	for(node *t=root;t!=Null;){
    		s=t->c[0]->size+t->s;
    		if(x>t->val)res+=s,t=t->c[1];
    		else t=t->c[0];
    	}return res;
    }  
	void insert(int x,int siz){_insert(root,x,siz);}
	int rank(int x){return _rank(root,x);}
	int size(){return root->size;}
	int find(int x){return _find(root,x);}
};
int Ranks,Finds;
unsigned int Size;
struct seg_tree{
	Treap loc[maxn<<2];
	Treap lazy[maxn<<2];
	void change(int i,int l,int r,int l0,int r0,int c){		
		if(l0<=l&&r0>=r){	
			lazy[i].insert(c,r-l+1);	
			return;
		}
		int mid=(l+r)>>1;
		loc[i].insert(c,min(r,r0)-max(l,l0)+1);
		if(l0<=mid)change(i<<1,l,mid,l0,r0,c);
		if(r0>mid)change(i<<1|1,mid+1,r,l0,r0,c);
	}
	void _rank(int i,int l,int r,int l0,int r0,int x){
		Ranks+=(LL)lazy[i].rank(x)*(min(r,r0)-max(l,l0)+1)/(r-l+1);
		if(l0<=l&&r0>=r){
			Ranks+=loc[i].rank(x);
			return;
		}int mid=(l+r)>>1;
		if(l0<=mid)_rank(i<<1,l,mid,l0,r0,x);
		if(r0>mid)_rank(i<<1|1,mid+1,r,l0,r0,x);
	}
	int rank(int l,int r,int x){
		Ranks=0;
		_rank(1,1,n,l,r,x);
		return Ranks;
	}
	void _size(int i,int l,int r,int l0,int r0){
		Size+=lazy[i].size()/(r-l+1)*(min(r,r0)-max(l,l0)+1);
		if(l0<=l&&r0>=r){
			Size+=loc[i].size();
			return ;
		}int mid=(l+r)>>1;
		if(l0<=mid)_size(i<<1,l,mid,l0,r0);
		if(r0>mid)_size(i<<1|1,mid+1,r,l0,r0);	
	}
	unsigned int size(int l,int r){
		Size=0;
		_size(1,1,n,l,r);
		return Size;
	}
	void _find(int i,int l,int r,int l0,int r0,int x){
		Finds+=lazy[i].find(x)/(r-l+1)*(min(r,r0)-max(l,l0)+1);
		if(l0<=l&&r0>=r){
			Finds+=loc[i].find(x);
			return ;
		}int mid=(l+r)>>1;	
		if(l0<=mid)_find(i<<1,l,mid,l0,r0,x);
		if(r0>mid)_find(i<<1|1,mid+1,r,l0,r0,x);	
	}
	int find(int l,int r,int x){
		Finds=0;
		_find(1,1,n,l,r,x);
		return Finds;
	}
}T;
void Change(int l,int r,int k){
	T.change(1,1,n,l,r,k);	
}
int Kth(int l0,int r0,int k){
	unsigned int siz=T.size(l0,r0);
	k=siz-k+1;
	unsigned int l=1,r=maxx,mid;
	while(l<r){
		mid=(l+r)>>1;
		int ra=T.rank(l0,r0,mid);
		int s=T.find(l0,r0,mid);
		if(!ra&&!s)ra=-1;
		if(ra==siz&&!s)ra=ra+1;
		if(ra+1<=k&&k<=ra+s)return mid;
		if(ra<k)
			l=mid+1;
		else
			r=mid;
	}return l;
}
void putint(int x){
	if(x<10)
		putchar(x+'0');
	else{
		putint(x/10);
		putchar(x%10+'0');
	}
}
int main(){
	int res,op,l,r,k;
	n=getint();m=getint();
	while(m--){
		op=getint();
		l=getint(),r=getint(),k=getint();
		if(op==1){
 			Change(l,r,k);
 			maxx=max(maxx,k);
		}else{
			res=Kth(l,r,k);
			putint(res);
			puts("");
		}
	}
	return 0;
}