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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
| #include<bits/stdc++.h>
#define gc getchar
#define pc putchar
#define F(i,x,y) for(int i=x;i<=y;++i)
#define R(i,x,y) for(int i=x;i>=y;--i)
inline int read(){
int x=0;char ch=gc();while (!isdigit(ch)) ch=gc();
while (isdigit(ch)) x=(x<<1)+(x<<3)+(ch^'0'),ch=gc();return x;
}
inline void print(int x){ if (x>9) print(x/10);pc('0'+x%10); }
const int N=2e5+5;
int n,m,A[N],rt,tot;
struct Splay{
int son[2],fa,sz,sum,rev,val,cnt;
#define son(i,j) G[i].son[j]
#define fa(i) G[i].fa
#define sz(i) G[i].sz
#define sum(i) G[i].sum
#define rev(i) G[i].rev
#define val(i) G[i].val
#define cnt(i) G[i].cnt
} G[N<<2];
inline void swap(int& x,int& y){
int z=x;x=y;y=z;
}
inline void maintain(int k){
if (!k) return;
sz(k)=sz(son(k,0))+sz(son(k,1))+cnt(k);
sum(k)=sum(son(k,0))^sum(son(k,1))^((cnt(k)&1)?val(k):0);
}
inline void letrev(int k){
if (!k) return;
rev(k)^=1,swap(son(k,0),son(k,1));
}
inline void pushdown(int k){
if (!rev(k)||!k) return;
letrev(son(k,0)),letrev(son(k,1));
rev(k)=0;
}
void _put(int cur){
if (!cur) return;
pushdown(cur);
_put(son(cur,0));
printf("rt=%d, id=%d, fa=%d, sz=%d, sum=%d, rev=%d, val=%d, cnt=%d, ls=%d, rs=%d\n"
,rt,cur,fa(cur),sz(cur),sum(cur),rev(cur),val(cur),cnt(cur),son(cur,0),son(cur,1));
_put(son(cur,1));
}
void OUTPUT(){
printf("OUT::: \n"),_put(rt),pc('\n');
}
inline int addnod(int c,int v){
cnt(++tot)=c,val(tot)=v;
return maintain(tot),tot;
}
inline bool get(int k){ return k==son(fa(k),1); }
inline void rotate(int k){
int x=fa(k),y=fa(x),p=get(k);
son(x,p)=son(k,p^1);if (son(x,p)) fa(son(x,p))=x;
son(k,p^1)=x;fa(x)=k;
if (y) son(y,x==son(y,1))=k;else rt=k;fa(k)=y;
maintain(x),maintain(k);
}
inline void splay(int k,int pos){
if (!k) return;
for (int i=fa(k);(i=fa(k))!=pos;rotate(k)){
if (fa(i)!=pos) rotate(get(k)==get(i)?i:k);
}
}
int remaink;
inline int findk(int k){
if (k<1||k>sz(rt)) return (remaink=0),0;
int cur=rt;
while (cur){
pushdown(cur);
if (k<=sz(son(cur,0))) cur=son(cur,0);
else if (k<=sz(son(cur,0))+cnt(cur)) return (remaink=k-sz(son(cur,0))),cur;
else k-=sz(son(cur,0))+cnt(cur),cur=son(cur,1);
}
return 0;
}
inline int split(int k,int pos){
if (!k||pos==cnt(k)) return 0;
if (pos>cnt(k)||pos<0) printf("k = %d, pos = %d, cnt(k) = %d\n",k,pos,cnt(k)),exit(0);
if (pos==0) return k;
int cur=addnod(cnt(k)-pos,val(k));
cnt(k)=pos,son(cur,1)=son(k,1),son(k,1)=cur;
fa(cur)=k;if (son(cur,1)) fa(son(cur,1))=cur;
maintain(cur),maintain(k);
return cur;
}
inline void Insert(int pos,int c,int v){
int x=findk(pos),cur=addnod(c,v);
splay(x,0);
int y=findk(pos+1);
if (x==y) y=split(x,remaink-1);
if (y){
splay(y,x);
son(y,0)=cur,fa(cur)=y;
maintain(y),maintain(x);
}else{
son(x,1)=cur,fa(cur)=x;
maintain(x);
}
}
inline void Reverse(int le,int ri){
if (le==ri) return;
if (le==1&&ri==sz(rt)) return letrev(rt);
int x=findk(le-1);
split(x,remaink);
splay(x,0);
int y=findk(ri+1);
y=split(y,remaink-1);
if (y){
splay(y,x);
letrev(son(y,0));
}else{
letrev(son(x,1));
}
}
inline int mostle(int k){
if (!k) return 0;
while ((pushdown(k),son(k,0))) k=son(k,0);
return k;
}
inline int mostri(int k){
if (!k) return 0;
while ((pushdown(k),son(k,1))) k=son(k,1);
return k;
}
inline void letrot(int cur){
int l=mostle(cur),r=mostri(cur);
if (cnt(r)>1){
r=split(r,cnt(r)-1);
int fr=fa(r);
if (fr) son(fr,r==son(fr,1))=0;
son(l,0)=r,fa(r)=l;
return maintain(fr),maintain(r),maintain(l),splay(l,0),splay(fr,0);
}else{
int fr=fa(r);
if (son(r,0)) fa(son(r,0))=fr;
if (fr) son(fr,r==son(fr,1))=son(r,0);
son(r,0)=0,son(l,0)=r,fa(r)=l;
return maintain(fr),maintain(r),maintain(l),splay(l,0),splay(fr,0);
}
}
inline void Rotate(int le,int ri){
if (le==ri) return;
if (le==1&&ri==sz(rt)){
return letrot(rt);
}
int x=findk(le-1);
split(x,remaink);
splay(x,0);
int y=findk(ri+1);
y=split(y,remaink-1);
if (y){
splay(y,x);
letrot(son(y,0));
}else{
letrot(son(x,1));
}
}
inline int Sum(int le,int ri){
if (le==1&&ri==sz(rt)) return sum(rt);
int x=findk(le-1);
split(x,remaink);
splay(x,0);
int y=findk(ri+1);
y=split(y,remaink-1);
if (y){
splay(y,x);
return sum(son(y,0));
}else{
return sum(son(x,1));
}
}
int Build(int l,int r){
if (l>r) return 0;
if (l==r) return addnod(1,A[l]);
int mid=l+r>>1,cur=addnod(1,A[mid]);
son(cur,0)=Build(l,mid-1);
son(cur,1)=Build(mid+1,r);
if (son(cur,0)) fa(son(cur,0))=cur;
if (son(cur,1)) fa(son(cur,1))=cur;
maintain(cur);
return cur;
}
signed main(){
n=read(),m=read();
F(i,1,n) A[i]=read();
rt=Build(1,n);
F(i,1,m){
int op=read(),x=read(),y=read();
if (op==1){
int z=read();
Insert(x,y,z);
}else if (op==2){
Reverse(x,y);
}else if (op==3){
Rotate(x,y);
}else if (op==4){
print(Sum(x,y)),pc('\n');
}
}
return 0;
}
|