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 | #include <bits/stdc++.h>
using namespace std;
inline int read()
{
int x = 0, f = 1;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
{
x = (x << 3) + (x << 1) + (ch - '0');
}
return f * x;
}
inline void write(int x)
{
if (x < 0)
{
putchar('-');
x = -x;
}
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
return;
}
const int MAXN = 1e5 + 10;
mt19937 rnd(time(0));
class FHQ_Treap
{
int rt, idx, siz[MAXN], ls[MAXN], rs[MAXN], rd[MAXN], val[MAXN];
inline int newnode(int v = 0)
{
siz[++idx] = 1;
ls[idx] = rs[idx] = 0;
rd[idx] = rnd();
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[y]);
}
else
{
x = u;
split(rs[u], v, rs[x], 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;
}
return 0;
}
int qry_by_rnk(int u, int rk)
{
while (siz[ls[u]] + 1 != rk)
if (rk <= siz[ls[u]])
u = ls[u];
else
rk -= siz[ls[u]] + 1, u = rs[u];
return u;
}
public:
FHQ_Treap() : idx(0), rt(0) {}
inline void insert(int v)
{
int x, y;
split(rt, v - 1, x, y);
rt = merge(merge(x, newnode(v)), y);
}
inline void remove(int v)
{
int x, y, z;
split(rt, v - 1, x, y);
split(y, v, y, z);
rt = merge(merge(x, merge(ls[y], rs[y])), z);
}
inline int rank(int v)
{
int x, y;
split(rt, v - 1, x, y);
int ret = siz[x] + 1;
rt = merge(x, y);
return ret;
}
inline int query_rank(int rk) { return val[qry_by_rnk(rt, rk)]; }
inline int less(int v)
{
int x, y;
split(rt, v - 1, x, y);
int ret = qry_by_rnk(x, siz[x]);
rt = merge(x, y);
return val[ret];
}
inline int more(int v)
{
int x, y;
split(rt, v, x, y);
int ret = qry_by_rnk(y, 1);
rt = merge(x, y);
return val[ret];
}
} treap;
int main()
{
int n = read();
while (n--)
{
switch (read())
{
case 1:
treap.insert(read());
break;
case 2:
treap.remove(read());
break;
case 3:
write(treap.rank(read()));
puts("");
break;
case 4:
write(treap.query_rank(read()));
puts("");
break;
case 5:
write(treap.less(read()));
puts("");
break;
case 6:
write(treap.more(read()));
puts("");
break;
}
}
return 0;
}
|