P1486 [NOI2004] 郁闷的出纳员

R70811692

Luogu/P1486/P1486.cpp

@@ -1,14 +1,90 @@
-#include <algorithm>
+#include <cstdlib>
 #include <iostream>
-#include <vector>
 
 using std::cin;
 using std::cout;
 const char endl = '\n';
 
-int n, min, k, c, cnt;
+const int N = 1e5;
+
+int n, min, k, c, ans;
 char op;
-std::vector<int> a;
+
+// Treap
+
+int root, cnt;
+
+struct node {
+    int l, r, s, v, k;
+
+    node()
+        : l(0), r(0), s(0), v(0), k(rand()) {}
+    node(int _v)
+        : l(0), r(0), s(1), v(_v), k(rand()) {}
+} tr[N];
+
+void pushup(int u) {
+    tr[u].s = tr[tr[u].l].s + 1 + tr[tr[u].r].s;
+}
+
+std::pair<int, int> split(int p, int k) {
+    if (!p) return std::make_pair(0, 0);
+    if (k <= tr[tr[p].l].s) {
+        auto o = split(tr[p].l, k);
+        tr[p].l = o.second;
+        pushup(p);
+        o.second = p;
+        return o;
+    }
+    auto o = split(tr[p].r, k - tr[tr[p].l].s - 1);
+    tr[p].r = o.first;
+    pushup(p);
+    o.first = p;
+    return o;
+}
+
+std::pair<int, int> splitByValue(int p, int v) {
+    if (!p) return std::make_pair(0, 0);
+    if (v <= tr[p].v) {
+        auto o = splitByValue(tr[p].l, v);
+        tr[p].l = o.second;
+        pushup(p);
+        o.second = p;
+        return o;
+    }
+    auto o = splitByValue(tr[p].r, v);
+    tr[p].r = o.first;
+    pushup(p);
+    o.first = p;
+    return o;
+}
+
+int merge(int x, int y) {
+    if (!x || !y) return x | y;
+    if (tr[x].k > tr[y].k) {
+        tr[x].r = merge(tr[x].r, y);
+        pushup(x);
+        return x;
+    }
+    tr[y].l = merge(x, tr[y].l);
+    pushup(y);
+    return y;
+}
+
+void insert(int v) {
+    auto o = splitByValue(root, v);
+    int p = ++cnt;
+    tr[p] = node(v);
+    root = merge(o.first, merge(p, o.second));
+}
+
+int getKth(int k) {
+    auto x = split(root, k - 1);
+    auto y = split(x.second, 1);
+    int r = y.first;
+    root = merge(x.first, merge(y.first, y.second));
+    return tr[r].v;
+}
 
 int main() {
     std::ios::sync_with_stdio(false);
@@ -17,19 +93,19 @@ int main() {
         cin >> op >> k;
         if (op == 'I') {
             if (k >= min) {
-                a.insert(std::lower_bound(a.begin(), a.end(), k - c), k - c);
+                insert(k - c);
             }
         } else if (op == 'A') {
             c += k;
         } else if (op == 'S') {
             c -= k;
-            auto it = std::lower_bound(a.begin(), a.end(), min - c);
+            auto o = splitByValue(root, min - c);
-            cnt += it - a.begin();
+            root = o.second;
-            a.erase(a.begin(), std::lower_bound(a.begin(), a.end(), min - c));
+            ans += tr[o.first].s;
         } else {  // op == 'F'
-            cout << (a.size() < k ? -1 : *(a.end() - k) + c) << endl;
+            cout << (tr[root].s < k ? -1 : getKth(tr[root].s - k + 1) + c) << endl;
         }
     }
-    cout << cnt << endl;
+    cout << ans << endl;
     return 0;
 }