珂朵莉树求调WA#3

#include<bits/stdc++.h>
#define IT set<node>::iterator 
#define pll pair<long long,long long>
#define ll long long
#define pb push_back
using namespace std;
const int inf=1e9;
ll seed,n,m,vmax;
struct node{
	int l,r;
	mutable ll v;
	node (int lll=0,int rr=0,ll vv=0) {
		l=lll;r=rr;v=vv;
	}
	bool operator <(const node &i)const {
		return l<i.l;
	}
};
set <node> s;
ll rnd(){
    ll ret=seed;
    seed=(seed*7+13)%1000000007;
    return ret;
}
IT split(int x){
	IT it=s.lower_bound(node(x,0,0));
	if(it!=s.end() && it->l==x) return it;
	it--;
	if(it->r<x) return s.end();
	int L=it->l,R=it->r;ll V=it->v;
	s.erase(it);
	s.insert(node(L,x-1,V));
	return s.insert(node(x,R,V)).first;
}
ll pow(ll x,ll y,ll	mod){
	ll sum=1;
	while(y>1){
		if(y%2==1) sum*=x,sum%=mod;
		x*=x;x%=mod;y/=2;
	}
	sum*=x;sum%=mod;
	return sum;
}
void assign(int l,int r,ll x){
	IT itr=split(r+1),itl=split(l);
	s.erase(itl,itr);
	s.insert(node(l,r,x));
}
void update(int l,int r,ll x){
	IT itr=split(r+1),itl=split(l);
	for(IT it=itl;it!=itr;it++)
		it->v+=x;
}
bool cmp(pll a,pll b){
	return a.first<b.first;
}
ll rankk(int l,int r,int k) {
	vector<pll> p;
	IT itr=split(r+1),itl=split(l);
	p.clear();
	for(IT it=itl;it!=itr;it++)
		p.pb(make_pair(itl->v,it->r - it->l + 1));
	sort(p.begin(),p.end(),cmp);
	for(vector<pll >::iterator it=p.begin();it!=p.end();it++){
		k-= it->second;
		if(k<=0) return it->first;
	}
	return -inf;
}
ll pow_query(int l,int r,ll x,ll mod){
	IT itr=split(r+1),itl=split(l);
	ll sum=0;
	for(IT it=itl;it!=itr;it++){
		ll vv=it->v;
		vv=pow(vv,x,mod);
		sum+=vv*(it->r - it->l +1);
		sum%=mod;
	} 
	return sum;
}
signed main(){
	scanf("%lld%lld%lld%lld",&n,&m,&seed,&vmax);
	for(int i=1;i<=n;i++){s.insert(node(i,i,(rnd()%vmax)+1));}	
	for(int i=1;i<=m;i++)
	{
		int op=(rnd()%4)+1;
		int l=(rnd()%n)+1;
		int r=(rnd()%n)+1;
		ll x,y;
		if(l>r)swap(l,r);
		if(op==3) x=(rnd()%(r-l+1))+1;
		else x=(rnd()%vmax)+1;
		if(op==4) y=(rnd()%vmax)+1;
		printf("%d %d %d %lld %lld\n",op,l,r,x,y);
		if(op==1) update(l,r,x);
		if(op==2) assign(l,r,x);
		if(op==3) printf("%lld\n",rankk(l,r,x));
		if(op==4) printf("%lld\n",pow_query(l,r,x,y));
	}
	return 0;
}