deckart tree (split, merge, insert, erase, get)

/*

 ∧＿∧
( ･ω･｡)つ━☆・*。
⊂　 ノ 　　　・゜
しーＪ　　 Accepted

*/



// #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define x first
#define y second
#define int long long

using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(14);
    #ifdef _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
        freopen("river.in", "r", stdin);
        freopen("river.out", "w", stdout);
    #endif
}

const int MAXN = 1e6 + 10;
const int MAXM = 600;
const int INF = 1e18;
const int BASE = 47;
const int MOD = 1e9 + 7;
const int MAXLOG = 21;

mt19937 rr(time(0));

struct treap {
    treap *left = nullptr;
    treap *right = nullptr;
    int sum, prior, sz, val, orig;

    treap(int sum, int orig) {
        this->sum = sum;
        this->val = sum;
        this->orig = orig;
        this->prior = rr();
        this->sz = 1;
    }
};


int get_size(treap *&root) {
    return ((root == nullptr) ? 0 : root->sz);
}

int get_val(treap *&root) {
    return ((root == nullptr) ? 0 : root->sum);
}

int get_val2(treap *&root) {
    return ((root == nullptr) ? 0 : root->orig);
}

void print(treap *a) {
    if(a->left != nullptr) print(a->left);
    cerr << get_val2(a) << " " << get_val2(a->left) << " " << get_val2(a->right) << " " << get_size(a) << '\n';
    if(a->right != nullptr) print(a->right);
}

void update(treap *&root) {
    if(root == nullptr) return;
    root->sz = get_size(root->left) + get_size(root->right) + 1;
    root->sum = get_val(root->left) + get_val(root->right) + root->val;
}

pair<treap*, treap*> split(treap *&root, int key) {
    if(root == nullptr) {
        return {nullptr, nullptr};
    }
    int root_key = get_size(root->left);
    // cerr << root->sz << " " << root_key << '\n';
    if(key > root_key) {
        pair<treap*, treap*> splitted = split(root->right, key - get_size(root->left) - 1);
        root->right = splitted.x;
        update(root);
        return {root, splitted.y};
    }
    else {
        pair<treap*, treap*> splitted = split(root->left, key);
        root->left = splitted.y;
        update(root);
        return {splitted.x, root};
    }
}

treap* merge(treap *&left, treap *&right) {
    if(left == nullptr) {
        return right;
    }
    if(right == nullptr) {
        return left;
    }
    if(left->prior > right->prior) {
        left->right = merge(left->right, right);
        update(left);
        return left;
    }
    else {
        right->left = merge(left, right->left);
        update(right);
        return right;
    }
}

void insert(treap *&root, int pos, int val) {
    pair<treap*, treap*> splitted = split(root, pos);
    treap *nw = new treap(val * val, val);
    splitted.x = merge(splitted.x, nw);
    update(splitted.x);
    // cerr << get_val(left) << '\n';
    splitted.x = merge(splitted.x, splitted.y);
    update(splitted.x);
    // cerr << get_val(left) << '\n';
    root = splitted.x;
}

void erase(treap *&root, int pos) {
    if(pos < get_size(root->left)) {
        erase(root->left, pos);
    }
    else if(pos > get_size(root->left)) {
        erase(root->right, pos - get_size(root->left) - 1);
    }
    else {
        root = merge(root->left, root->right);
    }
    update(root);
}

int get(treap *&root, int pos) {
    if(pos < get_size(root->left)) {
        return get(root->left, pos);
    }
    else if(pos > get_size(root->left)) {
        return get(root->right, pos - get_size(root->left) - 1);
    }
    else {
        return get_val2(root);
    }
}

signed main() {
    seriy();
    int n, p;
    cin >> n >> p;
    vector<int> a(n);
    treap *root = nullptr;
    // print(root);
    int cnt = n;
    pair<treap*, treap*> splitted = split(root, 0);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        insert(root, i, a[i]);
        // cerr << root->sz << '\n';
    }
    // print(root);
    cout << root->sum << '\n';
    int q;
    cin >> q;
    while(q--) {
        int t, pos;
        cin >> t >> pos;
        pos--;
        if(t == 2) {
            int w = get(root, pos);
            erase(root, pos);
            insert(root, pos, (w + 1) / 2);
            insert(root, pos, w / 2);
            cnt++;
        }
        else {
            if(pos == 0) {
                int a = get(root, 0);
                int b = get(root, 1);
                erase(root, 0);
                erase(root, 0);
                int nv = (a + b);
                // cerr << nv << '\n';
                insert(root, 0, nv);
            }
            else if(pos == cnt - 1) {
                int a = get(root, cnt - 1);
                int b = get(root, cnt - 2);
                erase(root, cnt - 2);
                erase(root, cnt - 2);
                int nv = a + b;
                insert(root, cnt - 2, nv);
            }
            else {
                int a = get(root, pos - 1);
                int b = get(root, pos + 1);
                int w = get(root, pos);
                erase(root, pos - 1);
                erase(root, pos - 1);
                erase(root, pos - 1);
                int nv1 = b + (w + 1) / 2;
                int nv2 = a + w / 2;
                insert(root, pos - 1, nv1);
                insert(root, pos - 1, nv2);
            }
            cnt--;
        }
        cout << root->sum << '\n';
    }
    return 0;
}