记录编号	360618	评测结果	AAAAAAAAAA
题目名称	[HZOI 2016]剩蛋节的礼物	最终得分	100
用户昵称	Go灬Fire	是否通过	通过
代码语言	C++	运行时间	3.268 s
提交时间	2016-12-30 19:53:19	内存使用	76.62 MiB

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
const int maxn=1000000+200;
struct Node{
	int date,lazy;
}a[maxn<<2];
struct Ques{
	int type,num,date1,date2;
}q[maxn];
struct Query{
	int num,l,r,id,ans;
	bool operator < (const Query & a)const{
		return num<a.num;
	}
}Ans[maxn];
bool Comp(const Query & a,const Query & b){return a.id<b.id;}
int n,m,L[maxn],R[maxn],v[maxn];
int aa,bb,cc,M1,d,e,f,M2,g,h,I,M3;
inline void Update(int rt,int l,int r){
	int z=a[rt].lazy;a[rt].lazy=0;
	a[rt<<1].lazy+=z;a[rt<<1|1].lazy+=z;
	int mid=(l+r)>>1;
	a[rt<<1].date+=1ll*z*(mid-l+1);a[rt<<1|1].date+=1ll*z*(r-mid);
}
inline void Insert(int s,int t,int z,int rt,int l,int r){
	if(s<=l && t>=r){
		a[rt].date+=1ll*z*(r-l+1);
		a[rt].lazy+=z;
		return;
	}
	int mid=(l+r)>>1;
	if(a[rt].lazy)Update(rt,l,r);
	if(s<=mid)Insert(s,t,z,lson);
	if(t>mid)Insert(s,t,z,rson);
	a[rt].date=a[rt<<1].date+a[rt<<1|1].date;
}
inline int Get_sum(int s,int t,int rt,int l,int r){
	if(s<=l && t>=r)return a[rt].date;
	int mid=(l+r)>>1;
	if(a[rt].lazy)Update(rt,l,r);
	if(t<=mid)return Get_sum(s,t,lson);
	if(s>mid)return Get_sum(s,t,rson);
	return Get_sum(s,t,lson)+Get_sum(s,t,rson);
}
LL mul=1;
inline void Mul(int rt,int l,int r){
	if(l==r){mul*=1ll*a[rt].date;return;}
	int mid=(l+r)>>1;
	if(a[rt].lazy)Update(rt,l,r);
	Mul(lson);Mul(rson);
}
LL Mul(){
	mul=1;
	Mul(1,1,n);
	return mul;
}
inline int Read(){
	char ch;int f=1,x=0;
	while(ch=getchar(),(ch<'0' || ch>'9') && ch!='-');
	if(ch=='-')f=-1,ch=getchar();x=ch-48;
	while(ch=getchar(),ch>='0' && ch<='9')x=x*10+ch-48;
	return x;
}
void Init();
int main(){
    freopen("Rabbit_gift.in","r",stdin);freopen("Rabbit_gift.out","w",stdout);
    Init();
    getchar();getchar();
    return 0;
}
void Init(){
	scanf("%d%d",&n,&m);
	scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",
	   &aa,&bb,&cc,&M1,&L[0],&d,&e,&f,&M2,&R[0],&g,&h,&I,&M3,&v[0]);
	if(L[0]>R[0])swap(L[0],R[0]);
	for(int i=1;i<=m;i++){
		v[i]=(g*v[i-1]*v[i-1]+h*v[i-1]+I)%M3;
		L[i]=(aa*L[i-1]*L[i-1]+bb*L[i-1]+cc)%M1+1;
		R[i]=(d*R[i-1]*R[i-1]+e*R[i-1]+f)%M2+1;
		if(L[i]>R[i])swap(L[i],R[i]);
	}
	int T=0;scanf("%d",&T);int cnt=0;
	for(int i=1;i<=T;i++){
		int type=Read();
		int x,y,z;
		if(type==1){
			x=Read();y=Read();z=Read();
			Ans[++cnt].num=x;   Ans[cnt].l=y;   Ans[cnt].r=z;   Ans[cnt].id=i;
			q[i].type=1;
		}else if(type>=2 && type<=4){
			x=Read();y=Read();
			q[i].type=type;q[i].date1=x;q[i].date2=y;
		}else q[i].type=type;
	}
	sort(Ans+1,Ans+cnt+1);
	int now=1;
	for(int i=1;i<=m;i++){
		Insert(L[i],R[i],v[i],1,1,n);
		while(Ans[now].num==i){
			Ans[now].ans=Get_sum(Ans[now].l,Ans[now].r,1,1,n);
			now++;
		}
	}
	sort(Ans+1,Ans+cnt+1,Comp);
	now=1;
	for(int i=1;i<=T;i++){
		if(q[i].type==1){
			printf("%d\n",Ans[now].ans);
			now++;continue;
		} if(q[i].type==2) {
			Insert(q[i].date1,q[i].date1,q[i].date2,1,1,n);
		}else if(q[i].type==3){
			Insert(q[i].date1,q[i].date1,(-1)*q[i].date2,1,1,n);
		}else if(q[i].type==4){
			printf("%d\n",Get_sum(q[i].date1,q[i].date2,1,1,n));
		}else {
			printf("%lld\n",Mul());
		}
	}
}