P3369 【模板】普通平衡树

R69538002

Luogu/P3369/P3369.cpp

@@ -13,21 +13,12 @@ class Treap {
         node *left, *right;
         int size, val, key;
 
-        node()
+        node();
-            : left(nullptr), right(nullptr), size(1), val(0), key(rand()) {}
+        node(int);
-        node(int _val)
+        ~node();
-            : left(nullptr), right(nullptr), size(1), val(_val), key(rand()) {}
 
-        ~node() {
+        void pushup();
-            delete left, right;
+    } * root;
-        }
-
-        inline void pushup() {
-            this->size = 1;
-            if (this->left != nullptr) this->size += this->left->size;
-            if (this->right != nullptr) this->size += this->right->size;
-        }
-    } *root = nullptr;
 
     int getNodeSize(node *);
     node *find(node *, int);
@@ -37,8 +28,8 @@ class Treap {
     int _getRank(node *, int);
 
   public:
-    Treap()
+    Treap();
-        : root(nullptr) {}
+    ~Treap();
 
     void insert(int);
     void erase(int);
@@ -46,6 +37,33 @@ class Treap {
     int getKth(int);
 } tree;
 
+// struct Treap::node
+
+Treap::node::node()
+    : left(nullptr), right(nullptr), size(1), val(0), key(rand()) {}
+
+Treap::node::node(int _val)
+    : left(nullptr), right(nullptr), size(1), val(_val), key(rand()) {}
+
+Treap::node::~node() {
+    delete this->left, this->right;
+}
+
+inline void Treap::node::pushup() {
+    this->size = 1;
+    if (this->left != nullptr) this->size += this->left->size;
+    if (this->right != nullptr) this->size += this->right->size;
+}
+
+// class Treap
+
+Treap::Treap()
+    : root(nullptr) {}
+
+Treap::~Treap() {
+    delete root;
+}
+
 inline int Treap::getNodeSize(Treap::node *node) {
     return node == nullptr ? 0 : node->size;
 }