Submission #1513372

---

Source Code Expand

#include "bits/stdc++.h"
#include <random>
using namespace std;

mt19937 mt(0);

struct node {
        int sz;
        long long val, add, sum;
        node *lchild, *rchild;
        node(long long val, int sz, long long add, long long sum, node *lchild, node *rchild)
                     : val(val), sz(sz), add(add), sum(sum), lchild(lchild), rchild(rchild) {}
};

int size(node *t) { return !t ? 0 : t->sz; }
long long sum(node *t) { return !t ? 0 : t->sum; }

node *add(node *v, long long a) {
        if (!v) return NULL;
        int sz = v->sz;
        return new node(v->val, sz, v->add + a, v->sum + a * sz, v->lchild, v->rchild);
}

node *singleton(long long val) {
        return new node(val, 1, 0, val, NULL, NULL);
}

node *make_node(long long val, node *left, node *right, long long a = 0) { //+= a
        int sz = size(left) + size(right) + 1;
        return new node(val, sz, a, sum(left) + sum(right) + val + a * sz, left, right);
}

node *merge(node *left, node *right) {
        if (!left || !right) return !left ? right : left;
        if (int(mt() % (size(left) + size(right)) < size(left))) {
                if (left->add == 0) { 
                        return make_node(left->val + left->add, left->lchild, merge(left->rchild, right));
                }
                node *lv = add(left->lchild, left->add);
                node *rv = merge(add(left->rchild, left->add), right);
                return make_node(left->val + left->add, lv, rv);
        } else {
                if (right->add == 0) {
                        return make_node(right->val + right->add, merge(left, right->lchild), right->rchild);
                }
                node *lv = merge(left, add(right->lchild, right->add));
                node *rv = add(right->rchild, right->add);
                return make_node(right->val + right->add, lv, rv);
        }
}

pair<node *, node *> split(node *t, int k) { //[0, k), [k, n)
        if (k == 0) return pair<node *, node *>(NULL, t);
        if (k >= size(t)) return pair<node *, node *>(t, NULL);
        if (size(t->lchild) >= k) {
                auto left = split(t->lchild, k);
                auto rv = make_node(t->val, left.second, t->rchild, t->add);
                if (t->add == 0) return make_pair(left.first, rv);
                return make_pair(add(left.first, t->add), rv);
        } else {
                auto right = split(t->rchild, k - size(t->lchild) - 1);
                auto lv = make_node(t->val, t->lchild, right.first, t->add);
                if (t->add == 0) return make_pair(lv, right.second);
                return make_pair(lv, add(right.second, t->add));
        }
}

int main() {
        int n, q;
        cin >> n >> q;
        node *tree = NULL;
        for (int i = 0; i < n; i ++) {
                int x;
                cin >> x;
                tree = merge(tree, singleton(x));
        }
        while (q --) {
                int type, a, b, c, d, v;
                cin >> type;
                if (type == 1) {
                        cin >> a >> b >> v;
                        auto y = split(tree, b);
                        auto x = split(y.first, a - 1);
                        tree = merge(x.first, merge(add(x.second, v), y.second));
                } else if (type == 2) {
                        cin >> a >> b >> c >> d;
                        auto y = split(split(tree, d).first, c - 1).second;
                        auto x = split(tree, b);
                        auto left = split(x.first, a - 1).first;
                        auto right = x.second;
                        tree = merge(left, merge(y, right));
                } else {
                        cin >> a >> b;
                        long long ans = sum(split(split(tree, b).first, a - 1).second);
                        cout << ans << endl;
                }
        }
        return 0;
}

Submission Info

Judge Result