2020 CCPC 威海 G. Caesar Cipher(Hash + 线段树)

Description

Input
5 6
1 2 1 2 1
2 1 2 2
2 1 3 3
1 1 1
1 3 5
2 1 2 4
2 1 2 2

Output
no
yes
no
yes

Solution
题意很明了，就是两种操作，一种是对区间每个数+1再mod 65536，另一种则是判断两个区间的数是否相同
很容易想到用线段树维护区间Hash值的和，区间+1等价于Hash值+=base值
然而本题的关键在于每个数都是在mod 65536意义下的，每当+1到65536时，就变成0了，而此时的Hash值应变成0
我们考虑暴力维护溢出时的情况。每次区间更新后，都暴力将达到65536的值修改为0
这样维护的复杂度为$O(n\ast q\ast \log n/65536)$，是可以接受的

Code

#include <bits/stdc++.h>
#define ls rt << 1
#define rs rt << 1 | 1
typedef long long ll;
typedef unsigned long long ull;

using namespace std;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

const int mod = 998244253;
const int maxn = 1e6 + 7;
const int bb = 233333;
const int lim = 65536;

int n,q;
ll a[maxn], p[maxn];
struct Segtree{
	int l, r;
	ll mx, Hash, base, lazy;
}t[maxn<<2];

inline void push_up(int rt) {
	t[rt].Hash = (t[ls].Hash + t[rs].Hash) % mod;
	t[rt].mx = max(t[ls].mx, t[rs].mx);
}

void build(int rt,int l,int r) {
	t[rt].l = l, t[rt].r = r;
	t[rt].lazy = 0;
	if(l == r) {
		t[rt].mx = a[l];
		t[rt].Hash = (a[l] * p[l]) % mod;
		t[rt].base = p[l];
		return ;
	}
	int mid = (l + r) >> 1;
	build(ls,l,mid);build(rs,mid+1,r);
	t[rt].base = (t[ls].base + t[rs].base) % mod;
	push_up(rt);
}

inline void push_down(int rt) {
	if(t[rt].lazy) {
		ll k = t[rt].lazy; t[rt].lazy = 0;
		t[ls].mx += k, t[rs].mx += k;
		t[ls].lazy += k, t[rs].lazy += k;
		t[ls].Hash = (t[ls].Hash + (k * t[ls].base)%mod) % mod;
		t[rs].Hash = (t[rs].Hash + (k * t[rs].base)%mod) % mod;
	}
}

void update(int rt,int L,int R) {
	int l = t[rt].l, r = t[rt].r;
	if(L <= l && r <= R) {
		t[rt].mx++;
		t[rt].lazy++;
		t[rt].Hash = (t[rt].Hash + t[rt].base) % mod;
		return ;
	}int mid = (l + r) >> 1;
	push_down(rt);
	if(L <= mid) update(ls,L,R);
	if(R  > mid) update(rs,L,R);
	push_up(rt);
}

ll query(int rt,int L,int R) {
	int l = t[rt].l, r = t[rt].r;
	if(L <= l && r <= R) {
		return t[rt].Hash;
	}ll sum = 0;
	int mid = (l + r) >> 1;
	push_down(rt);
	if(L <= mid) sum = (sum + query(ls,L,R)) % mod;
	if(R  > mid) sum = (sum + query(rs,L,R)) % mod;
	return sum;
}

bool check(int x, int y,int len) {
	if(x > y) swap(x,y);
	// debug3(query(1,x,x+len-1), p[y-x], query(1,y,y+len-1));
	return (query(1,x,x+len-1) * p[y-x]) % mod == query(1,y,y+len-1);
}

void modify(int rt,int L,int R) {
	int l = t[rt].l , r = t[rt].r;
	if(t[rt].mx < lim) return ;
	if(l == r) {
		t[rt].Hash = 0;
		t[rt].mx = 0;
		return ;
	}int mid = (l + r) >> 1;
	push_down(rt);
	if(L <= mid) modify(ls,L,R);
	if(R  > mid) modify(rs,L,R);
	push_up(rt);
}

void init() {
	p[0] = 1;
	for(int i = 1;i <= n+100;++i) p[i] = (p[i-1] * bb) % mod;
}

int main() {
	scanf("%d%d",&n,&q);init();
	for(int i = 1;i <= n;++i) {scanf("%lld",&a[i]);}
	build(1,1,n);
	while(q--) {
		int op;scanf("%d",&op);
		if(op == 1) {
			int l,r;scanf("%d%d",&l,&r);
			update(1,l,r);
			modify(1,l,r);
		} else if(op == 2) {
			int x,y,len;scanf("%d%d%d",&x,&y,&len);
			if(check(x,y,len)) printf("yes\n"); else printf("no\n");
		}
	}
	return 0;
}