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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241 | #include <bits/stdc++.h>
using namespace std;
namespace IO
{
inline int read()
{
int x = 0;
char ch = getchar();
while (ch > '9' || ch < '0')
ch = getchar();
while (ch <= '9' && ch >= '0')
x = (x << 3) + (x << 1) + (ch - '0'), ch = getchar();
return x;
}
void write(int x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(int x)
{
write(x);
putchar('\n');
}
} // namespace IO
using namespace IO;
#define mid ((l + r) >> 1)
const int inf = 0x7fffffff, MAXN = 5e4 + 10, MAXV = 5e7 + 10;
inline int lc(int x) { return x << 1; }
inline int rc(int x) { return x << 1 | 1; }
mt19937 rnd(time(0));
int val[MAXV], ls[MAXV], rs[MAXV], n, m, siz[MAXV], rt[MAXN << 2], idx, rd[MAXV], arr[MAXN], b[MAXN << 2], lenb;
struct node
{
int op, l, r, k, pos;
} oper[MAXN];
namespace FHQ
{
inline int newnode(int v)
{
rd[++idx] = rnd();
siz[idx] = 1;
val[idx] = v;
return idx;
}
inline void update(int x) { siz[x] = siz[ls[x]] + siz[rs[x]] + 1; }
void split(int u, int v, int &x, int &y)
{
if (!u)
{
x = y = 0;
return;
}
if (v < val[u])
{
y = u;
split(ls[u], v, x, ls[u]);
}
else
{
x = u;
split(rs[u], v, rs[u], y);
}
update(u);
}
int merge(int x, int y)
{
if (!x || !y)
return x + y;
if (rd[x] <= rd[y])
{
rs[x] = merge(rs[x], y);
update(x);
return x;
}
else
{
ls[y] = merge(x, ls[y]);
update(y);
return y;
}
}
inline int qrnk(int x, int k)
{
while (siz[ls[x]] + 1 != k)
if (k <= siz[ls[x]])
x = ls[x];
else
k -= siz[ls[x]] + 1, x = rs[x];
return x;
}
inline void insert(int &root, int v)
{
int x, y;
split(root, v - 1, x, y);
root = merge(merge(x, newnode(v)), y);
}
inline void del(int &root, int v)
{
int x, y, z;
split(root, v - 1, x, y);
split(y, v, y, z);
root = merge(merge(x, merge(ls[y], rs[y])), z);
}
inline int getfrnk(int &root, int v)
{
int x, y;
split(root, v - 1, x, y);
int res = siz[x];
root = merge(x, y);
return res;
}
inline int prev(int &root, int v)
{
int x, y;
split(root, v - 1, x, y);
int res = siz[x] ? val[qrnk(x, siz[x])] : -inf;
root = merge(x, y);
return res;
}
inline int more(int &root, int v)
{
int x, y;
split(root, v, x, y);
int res = siz[y] ? val[qrnk(y, 1)] : inf;
root = merge(x, y);
return res;
}
} // namespace FHQ
void build(int x, int l, int r)
{
for (int i = l; i <= r; i++)
FHQ::insert(rt[x], arr[i]);
if (l >= r)
return;
build(lc(x), l, mid);
build(rc(x), mid + 1, r);
}
void modify(int x, int l, int r, int p, int v)
{
FHQ::del(rt[x], arr[p]);
FHQ::insert(rt[x], v);
if (l == p && p == r)
{
arr[p] = v;
return;
}
if (p <= mid)
modify(lc(x), l, mid, p, v);
else
modify(rc(x), mid + 1, r, p, v);
}
int getfrnk(int x, int l, int r, int pl, int pr, int v)
{
if (r < pl || l > pr)
return 0;
if (pl <= l && r <= pr)
return FHQ::getfrnk(rt[x], v);
return getfrnk(lc(x), l, mid, pl, pr, v) + getfrnk(rc(x), mid + 1, r, pl, pr, v);
}
inline int qrnk(int k, int pl, int pr)
{
int l = 1, r = lenb, ans;
while (l <= r)
{
if (getfrnk(1, 1, n, pl, pr, b[mid]) + 1 <= k)
ans = b[mid], l = mid + 1;
else
r = mid - 1;
}
return ans;
}
int prev(int x, int l, int r, int pl, int pr, int v)
{
if (r < pl || l > pr)
return -inf;
if (pl <= l && r <= pr)
return FHQ::prev(rt[x], v);
return max(prev(lc(x), l, mid, pl, pr, v), prev(rc(x), mid + 1, r, pl, pr, v));
}
int more(int x, int l, int r, int pl, int pr, int v)
{
if (r < pl || l > pr)
return inf;
if (pl <= l && r <= pr)
return FHQ::more(rt[x], v);
return min(more(lc(x), l, mid, pl, pr, v), more(rc(x), mid + 1, r, pl, pr, v));
}
int main()
{
n = read(), m = read();
for (int i = 1; i <= n; i++)
b[++lenb] = arr[i] = read();
build(1, 1, n);
int opt, l, r, k, pos;
for (int i = 1; i <= m; i++)
switch (oper[i].op = read())
{
case 1:
oper[i].l = read(), oper[i].r = read(), oper[i].k = read();
break;
case 2:
oper[i].l = read(), oper[i].r = read(), oper[i].k = read();
break;
case 3:
oper[i].pos = read(), oper[i].k = read();
b[++lenb] = oper[i].k;
break;
case 4:
oper[i].l = read(), oper[i].r = read(), oper[i].k = read();
break;
case 5:
oper[i].l = read(), oper[i].r = read(), oper[i].k = read();
break;
}
sort(b + 1, b + 1 + lenb);
lenb = unique(b + 1, b + 1 + lenb) - b - 1;
for (int i = 1; i <= m; i++)
switch (oper[i].op)
{
case 1:
writeln(getfrnk(1, 1, n, oper[i].l, oper[i].r, oper[i].k) + 1);
break;
case 2:
writeln(qrnk(oper[i].k, oper[i].l, oper[i].r));
break;
case 3:
modify(1, 1, n, oper[i].pos, oper[i].k);
break;
case 4:
writeln(prev(1, 1, n, oper[i].l, oper[i].r, oper[i].k));
break;
case 5:
writeln(more(1, 1, n, oper[i].l, oper[i].r, oper[i].k));
break;
}
return 0;
}
|