分析:
看见将 l l l到 r r r均修改成 k k k这种区间修改操作就会想到 ———— 线段树!
考虑用线段树维护字符串 h a s h hash hash,那么询问呢?
对于每个询问
(
l
,
r
,
k
)
(l,r,k)
(l,r,k),我们需要确认这个区间是否满足:
s
i
=
s
i
+
k
(
i
=
l
,
l
+
1
,
⋯
,
r
−
k
)
s_i = s_{i + k}\,(i = l,l + 1,\cdots,r - k)
si=si+k(i=l,l+1,⋯,r−k)
看起来不太好做,来转化一下,令
s
(
l
,
r
)
s(l,r)
s(l,r)表示字符串
s
l
s
l
+
1
⋯
s
r
s_ls_{l + 1}\cdots s_r
slsl+1⋯sr,则询问可以转化为:
s
(
i
,
r
−
k
)
=
s
(
i
+
k
,
r
)
s(i,r - k) = s(i + k,r)
s(i,r−k)=s(i+k,r)
仍然可以用线段树区间查询!
那么这题就做完了,直接用线段树维护字符串 h a s h hash hash即可。
Code:
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1e5 + 50;
const long long p = 17,mod = 1e9 + 9;
int n,m,type,l,r,d;
long long pow[maxn],f[maxn],t[4 * maxn],tag[4 * maxn];
//pow[i]表示p的i次方,f[i]表示连续i个1的字符串的hash值,t为线段树
char s[maxn];
int read(){
int x = 0;
char c = getchar();
while(c < '0' || c > '9') c = getchar();
while(c >= '0' && c <= '9') x = x * 10 + (c ^ 48),c = getchar();
return x;
}
inline int ls(int x){
return x << 1;
}
inline int rs(int x){
return x << 1 | 1;
}
inline void push_up(int x,int k){
t[x] = ((t[ls(x)] * pow[k] % mod + t[rs(x)]) % mod + mod) % mod;
}
void push_down(int x,int l,int r){
if(tag[x] == -1) return;
int mid = (l + r) / 2;
t[ls(x)] = f[mid - l + 1] * tag[x] % mod,t[rs(x)] = f[r - mid] * tag[x] % mod;
tag[ls(x)] = tag[x],tag[rs(x)] = tag[x],tag[x] = -1;
}
void build(int x,int l,int r){
tag[x] = -1;
if(l == r){
t[x] = s[l] - '0' + 1;
return;
}
int mid = (l + r) / 2;
build(ls(x),l,mid),build(rs(x),mid + 1,r);
push_up(x,r - mid);
}
void update(int L,int R,int k,int x,int l,int r){
if(L <= l && R >= r) t[x] = f[r - l + 1] * k % mod,tag[x] = k;
else{
push_down(x,l,r);
int mid = (l + r) / 2;
if(L <= mid) update(L,R,k,ls(x),l,mid);
if(R > mid) update(L,R,k,rs(x),mid + 1,r);
push_up(x,r - mid);
}
}
long long query(int L,int R,int x,int l,int r){
if(L == l && R == r) return t[x];
else{
push_down(x,l,r);
int mid = (l + r) / 2;
if(R <= mid) return query(L,R,ls(x),l,mid);
else if(L > mid) return query(L,R,rs(x),mid + 1,r);
else return ((query(L,mid,ls(x),l,mid) * pow[R - mid] % mod + query(mid + 1,R,rs(x),mid + 1,r)) % mod + mod) % mod;
}
}
int main(){
n = read(),m = read() + read(),pow[0] = 1;
scanf("%s",s + 1);
for(int i = 1; i <= n; i ++) pow[i] = pow[i - 1] * p % mod,f[i] = (f[i - 1] * p % mod + 1) % mod;//预处理出pow与f
build(1,1,n);
for(int i = 1; i <= m; i ++){
type = read(),l = read(),r = read(),d = read();
if(type == 1) update(l,r,d + 1,1,1,n);
else{
if(d == r - l + 1){
printf("YES\n");
continue;
}
if(query(l,r - d,1,1,n) == query(l + d,r,1,1,n)) printf("YES\n");
else printf("NO\n");
}
}
return 0;
}