1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
| #include <bits/stdc++.h>
#define re register
using namespace std;
const int N = 2e5 + 10;
int T,n,q;
char s[N];
inline int read(){
int r = 0,w = 1;
char c = getchar();
while (c < '0' || c > '9'){
if (c == '-') w = -1;
c = getchar();
}
while (c >= '0' && c <= '9'){
r = (r << 3) + (r << 1) + (c ^ 48);
c = getchar();
}
return r * w;
}
struct seg{
#define ls(u) (u << 1)
#define rs(u) (u << 1 | 1)
struct node{
int l;
int r;
int tag;
int lc[2];
int rc[2];
bool f[2];
}tr[N << 2];
inline int Add(int a,int b){
return (a + b) % 26;
}
inline node merge(node a,node b){
node res = {a.l,b.r,0,{a.lc[0],a.lc[1]},{b.rc[0],b.rc[1]},{a.f[0] | b.f[0],a.f[1] | b.f[1]}};
if (!~res.lc[1]) res.lc[1] = b.lc[0];
if (!~res.rc[1]) res.rc[1] = a.rc[0];
if (~a.rc[0] && ~b.lc[0] && a.rc[0] == b.lc[0]) res.f[0] = true;
if (~a.rc[1] && ~b.lc[0] && a.rc[1] == b.lc[0]) res.f[1] = true;
if (~a.rc[0] && ~b.lc[1] && a.rc[0] == b.lc[1]) res.f[1] = true;
return res;
}
inline void calc(int u,int k){
for (re int i = 0;i <= 1;i++){
if (~tr[u].lc[i]) tr[u].lc[i] = Add(tr[u].lc[i],k);
if (~tr[u].rc[i]) tr[u].rc[i] = Add(tr[u].rc[i],k);
}
tr[u].tag = Add(tr[u].tag,k);
}
inline void pushup(int u){
tr[u] = merge(tr[ls(u)],tr[rs(u)]);
}
inline void pushdown(int u){
if (tr[u].tag){
calc(ls(u),tr[u].tag);
calc(rs(u),tr[u].tag);
tr[u].tag = 0;
}
}
inline void build(int u,int l,int r){
tr[u] = {l,r,0,{-1,-1},{-1,-1},{false,false}};
if (l == r){
tr[u].lc[0] = tr[u].rc[0] = s[l] - 'a';
return;
}
int mid = l + r >> 1;
build(ls(u),l,mid);
build(rs(u),mid + 1,r);
pushup(u);
}
inline void modify(int u,int l,int r,int k){
if (l <= tr[u].l && tr[u].r <= r){
calc(u,k);
return;
}
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
if (l <= mid) modify(ls(u),l,r,k);
if (r > mid) modify(rs(u),l,r,k);
pushup(u);
}
inline node query(int u,int l,int r){
if (l <= tr[u].l && tr[u].r <= r) return tr[u];
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
if (l <= mid && r > mid) return merge(query(ls(u),l,r),query(rs(u),l,r));
if (l <= mid) return query(ls(u),l,r);
if (r > mid) return query(rs(u),l,r);
}
#undef ls
#undef rs
}tree;
inline void solve(){
n = read();
q = read();
scanf("%s",s + 1);
tree.build(1,1,n);
while (q--){
int op;
op = read();
if (op == 1){
int l,r,x;
l = read();
r = read();
x = read();
tree.modify(1,l,r,x);
}
else{
int l,r;
l = read();
r = read();
auto res = tree.query(1,l,r);
if (res.f[0] | res.f[1]) puts("NO");
else puts("YES");
}
}
}
int main(){
T = read();
while (T--) solve();
return 0;
}
|