题意
实现区间+ 和询问l到r 是否有x的循环节
做法
如果有x的循环节 我们知道 长度-周期=border
所以我们就转换为 字符串哈希
具体要注意一下 pushup的时候 和 传懒标记的时候
注意不能 把lz 设置为0
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define pb push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define der(i,a,b) for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int n, m , k;
string s;
struct segment {
ll sum[N], seed, mo , c[N] ;
#define ls i*2
#define rs i*2+1
struct node {
int l, r, len;
ll ha, lz;
} tr[N ];
void push_up(int i) {
tr[i].ha = (tr[rs].ha % mo + c[tr[rs].len] * tr[ls].ha % mo ) % mo;
}
void update(int i, int son) {
tr[son].lz = tr[i].lz;
tr[son].ha = sum[tr[son].len - 1] * tr[son].lz % mo;
}
void push_down(int i) {
if(tr[i].lz ^ (-1)) {
update(i, ls);
update(i, rs);
}
tr[i].lz = -1;
}
void build(int i, int l, int r) {
tr[i] = {
l, r, r - l + 1, 0, -1
};
if(l == r) {
tr[i].ha = s[l] - '0';
return ;
}
int mid = (l + r) >> 1;
build(ls, l, mid);
build(rs, mid + 1, r);
push_up(i);
}
void change(int i, int l, int r, ll val) {
if(l <= tr[i].l && tr[i].r <= r) {
tr[i].lz = val % mo;
tr[i].ha = sum[tr[i].len - 1] * val % mo;
return ;
}
push_down(i);
int mid = tr[i].l + tr[i].r >> 1;
if(l <= mid) change(ls, l, r, val);
if(r > mid)change(rs, l, r, val);
push_up(i);
}
ll query(int i, int l, int r) {
if(l <= tr[i].l && tr[i].r <= r) return tr[i].ha % mo;
push_down(i);
int mid = (tr[i].l + tr[i].r) >> 1;
if(r <= mid) return query(ls, l, r) % mo;
else if(l > mid)return query(rs, l, r) % mo;
else return (query(ls, l, r) * c[ min(tr[i].r, r) - mid] % mo + query(rs, l, r) % mo) % mo;
}
void pre() {
c[0] = 1;
sum[0] = 1;
for(int i = 1; i <= n; i++) {
c[i] = c[i - 1] * seed % mo;
sum[i] = (sum[i - 1] + c[i]) % mo;
}
build(1, 1, n);
//cout<<"***";
}
} se[2];
void solve() {
se[0].seed = 131, se[0].mo = 1e9 + 7;
se[1].seed = 13331, se[1].mo = 1e9 + 9;
cin >> n >> m >> k;
cin >> s;
s = " " + s;
se[0].pre();
se[1].pre();
fer(i, 1, m + k) {
int op, l, r, x;
cin >> op >> l >> r >> x;
if(op == 1) {
se[0].change(1, l, r, x);
se[1].change(1, l, r, x);
} else {
if(r - l + 1 == x) {
puts("YES");
continue;
}
if((se[0].query(1, l, r - x) == se[0].query(1, l + x, r)) && (se[1].query(1, l, r - x) == se[1].query(1, l + x, r) ))
puts( "YES");
else {
puts("NO");
}
}
}
}
int main() {
IOS;
int _ = 1;
//cin>>_;
while( _-- )
solve();
}