-
Notifications
You must be signed in to change notification settings - Fork 0
/
4.2.cpp
264 lines (226 loc) · 6.18 KB
/
4.2.cpp
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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
#include <iostream>
#include <vector>
template<class T>
struct DefaultComparator {
int operator()(const T &l, const T &r) const {
if (l < r)
return 1;
else if (l > r)
return -1;
else
return 0;
}
};
template<class Key, class Comparator = DefaultComparator<Key>>
class AvlTree {
struct Node {
Key key;
Node *left;
Node *right;
int height;
int count;
Node(const Key &key) :
left(nullptr),
right(nullptr),
key(key),
height(1),
count(1) {
}
};
public:
AvlTree(Comparator comp = Comparator()) : root(nullptr), comp(comp) {
}
~AvlTree() {
free_all(root);
}
bool has(const Key &key) const {
return hasInternal(key, root);
}
void insert(const Key &key) {
root = insertInternal(key, root);
}
void erase(const Key &key) {
root = eraseInternal(findKeyInternal(key), root);
}
int findNum(const Key &key) const {
return findNumInternal(key, root);
}
private:
void free_all(Node *node){
if (node->left)
free_all(node->left);
if (node->right)
free_all(node->right);
delete node;
}
int findKeyInternal(int k){
Node* node = root;
while (node) {
int temp = node->left ? node->left->count : 0;
if (temp == k)
return node->key;
if (temp > k)
node = node->left;
else {
node = node->right;
k = k - 1 - temp;
}
}
return -1;
}
int findNumInternal(const Key &key, Node *node) const {
if (!node)
return -1;
Node *tmp = node;
int cmp_res;
int i = 0;
while (tmp != nullptr){
cmp_res = comp(key, tmp->key);
if (cmp_res == 1){
if (tmp->left) {
i += tmp->left->count + 1;
tmp = tmp->right;
} else{
tmp = tmp->right;
i += 1;
}
} else if (cmp_res == -1){
tmp = tmp->left;
} else{
if (tmp->left) {
return i + tmp->left->count;
} else{
return i;
}
}
}
return -1;
}
bool hasInternal(const Key &key, Node *node) const {
if (!node)
return false;
int cmp_res = comp(key, node->key);
if (cmp_res == 0)
return true;
if (cmp_res == -1)
return hasInternal(key, node->left);
if (cmp_res == 1)
return hasInternal(key, node->right);
return false;
}
Node *eraseInternal(const Key &key, Node *node) {
if (!node)
return nullptr;
int cmp_res = comp(key, node->key);
if (cmp_res == -1)
node->left = eraseInternal(key, node->left);
else if (cmp_res == 1)
node->right = eraseInternal(key, node->right);
else {
Node *left = node->left;
Node *right = node->right;
delete node;
if (!right)
return left;
Node *min_node = find_min(right);
min_node->right = remove_min(right);
min_node->left = left;
return balance(min_node);
}
return balance(node);
}
Node *find_min(Node *node) {
return node->left?find_min(node->left):node;
}
Node *remove_min(Node *node) {
if (node->left == nullptr)
return node->right;
node->left = remove_min(node->left);
return balance(node);
}
Node *insertInternal(const Key &key, Node *node) {
Node *tmp = node;
if (!node)
return new Node(key);
int cmp_res = comp(key, node->key);
if (cmp_res == -1)
node->left = insertInternal(key, node->left);
else if (cmp_res == 1)
node->right = insertInternal(key, node->right);
else
return tmp;
return balance(node);
}
int height(Node *node) {
if (!node)
return 0;
return node->height;
}
int count(Node *node) {
if (!node)
return 0;
return node->count;
}
int bfactor(Node *node) {
return height(node->right) - height(node->left);
}
void fix_height(Node *node) {
if (!node)
return;
if (height(node->left) > height(node->right))
node->height = std::max(height(node->left) + 1, height(node->right));
else
node->height = std::max(height(node->left), height(node->right) + 1);
node->count = count(node->left) + count(node->right) + 1;
}
Node *rotate_left(Node *node) {
Node *tmp = node->right;
node->right = tmp->left;
tmp->left = node;
fix_height(node);
fix_height(tmp);
return tmp;
}
Node *rotate_right(Node *node) {
Node *tmp = node->left;
node->left = tmp->right;
tmp->right = node;
fix_height(node);
fix_height(tmp);
return tmp;
}
Node *balance(Node *node) {
fix_height(node);
int bf = bfactor(node);
if (bf == 2) {
if (bfactor(node->right) < 0) {
node->right = rotate_right(node->right);
}
return rotate_left(node);
} else if (bf == -2) {
if (bfactor(node->left) > 0) {
node->left = rotate_left(node->left);
}
return rotate_right(node);
}
return node;
}
Node *root;
Comparator comp;
};
int main() {
AvlTree<int> avlTree;
int n, com, val;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> com >> val;
if (com == 1) {
avlTree.insert(val);
std::cout << avlTree.findNum(val) << std::endl;
} else if (com == 2){
avlTree.erase(val);
} else
return 0;
}
return 0;
}