ZOJ 3998 Yet Another Data Structure Problem (线段树)

Description

Sample Input
1
5 5
1 2 1 2 1
3 2 4
1 1 5 2
3 2 4
2 1 1 4
3 1 1
Sample Output
4
32
16

Solution
两个tag的线段树 + 欧拉降幂

Code

ll t[maxn << 2], lazy1[maxn << 2], lazy2[maxn << 2];
ll a[maxn];
ll qpow(ll x,ll n) {
	ll res = 1;
	while(n) {
		if(n & 1) res = (x * res) % mod;
		x = (x * x) % mod;
		n /= 2; 
	} return res;
}
void push_up(int rt) {t[rt] = (t[ls] * t[rs]) % mod;}
void build(int rt,int l,int r) {
	lazy1[rt] = lazy2[rt] = 1;
	if(l == r) {
		t[rt] = a[l];
	} else {
		int mid = (l + r) >> 1;
		build(ls,l,mid);build(rs,mid+1,r);
		push_up(rt);
	}
}
void push_down(int rt,int l,int r) {
	int mid = (l + r) >> 1;
	if(lazy2[rt] != 1) {
		ll k = lazy2[rt]; lazy2[rt] = 1;
		t[ls] = qpow(t[ls],k) % mod; t[rs] = qpow(t[rs],k) % mod;
		lazy1[ls] = qpow(lazy1[ls],k), lazy1[rs] = qpow(lazy1[rs],k);
		lazy2[ls] = (lazy2[ls] * k) % (mod-1), lazy2[rs] = (lazy2[rs] * k) % (mod-1);
	}

	if(lazy1[rt] != 1) {
		ll v = lazy1[rt]; lazy1[rt] = 1;
		t[ls] = (t[ls] * qpow(v,(mid-l+1))) % mod, t[rs] = (t[rs] * qpow(v,(r-mid))) % mod;
		lazy1[ls] = (lazy1[ls] * v) % mod, lazy1[rs] = (lazy1[rs] * v) % mod;
	}
}
void update1(int rt,int l,int r,int L,int R,int v) {
	if(L <= l && r <= R) {
		t[rt] = (t[rt] * qpow(v,1ll*(r - l + 1))) % mod;
		lazy1[rt] = (lazy1[rt] * v) % mod; return ;
	}
	int mid = (l + r) >> 1;
	push_down(rt,l,r);
	if(L <= mid) update1(ls,l,mid,L,R,v);
	if(R  > mid) update1(rs,mid+1,r,L,R,v);
	push_up(rt);
}
void update2(int rt,int l,int r,int L,int R,int k) {
	if(L <= l && r <= R) {
		t[rt] = qpow(t[rt],k) % mod;
		lazy1[rt] = qpow(lazy1[rt],k);
		lazy2[rt] = (lazy2[rt] * k) % (mod-1);
		return ;
	}
	int mid = (l + r) >> 1;
	push_down(rt,l,r);
	if(L <= mid) update2(ls,l,mid,L,R,k);
	if(R  > mid) update2(rs,mid+1,r,L,R,k);
	push_up(rt);
}
ll query(int rt,int l,int r,int L,int R) {
	ll res = 1;
	if(L <= l && r <= R) {
		return t[rt];
	}
	push_down(rt,l,r);
	int mid = (l + r) >> 1;
	if(L <= mid) res = (res * query(ls,l,mid,L,R)) % mod;
	if(R  > mid) res = (res * query(rs,mid+1,r,L,R)) % mod;
	return res;
}
int main() {
	int T;scanf("%d",&T);
	while(T--) {
		int n,q;scanf("%d %d",&n,&q);
		for(int i = 1;i <= n;++i) {scanf("%lld",&a[i]);}
		build(1,1,n);
		//debug1("ok1");
		while(q--) {
			int op;scanf("%d",&op);
			if(op == 1) {
				int l,r,v;scanf("%d%d%d",&l,&r,&v);
				update1(1,1,n,l,r,v);
			}
			if(op == 2) {
				int l,r,k;scanf("%d%d%d",&l,&r,&k);
				update2(1,1,n,l,r,k);
			}
			if(op == 3) {
				int l,r;scanf("%d%d",&l,&r);
				ll res = query(1,1,n,l,r);
				printf("%lld\n", res);
			}
		}
	}
    return 0;
}