TLE 了

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;

int n, m, x, y, k, a[N], opt;

struct Node
{
    int s[2], p, v;
    int size, sum;
    int flag;
    
    void init(int _v, int _p)
    {
        flag = 0;
        sum = v = _v, p = _p;
        size = 1;
    }
}tr[N];
int root, idx;

void pushup(int x)
{
    // TODO: 利用子节点信息维护当前节点信息
    tr[x].sum = tr[tr[x].s[0]].sum + tr[tr[x].s[1]].sum + tr[x].v;
    tr[x].size = tr[tr[x].s[0]].size + tr[tr[x].s[1]].size + 1;
}

void pushdown(int x)
{
    // TODO: 将懒标记下传
    int k = tr[x].flag;
    tr[x].flag = 0;
    int u = tr[x].s[0];
    if(u){
        tr[u].flag += k;
        tr[u].v += k;
        tr[u].sum += tr[u].size * k;
    }
    u = tr[x].s[1];
    if(u){
        tr[u].flag += k;
        tr[u].v += k;
        tr[u].sum += tr[u].size * k;
    }
}

void rotate(int x)  // 旋转
{
    int y = tr[x].p, z = tr[y].p;
    int k = tr[y].s[1] == x;
    tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z;
    tr[y].s[k] = tr[x].s[k ^ 1], tr[tr[x].s[k ^ 1]].p = y;
    tr[x].s[k ^ 1] = y, tr[y].p = x;
    pushup(y), pushup(x);
}

void splay(int x, int k)  // splay操作
{
    while (tr[x].p != k)
    {
        int y = tr[x].p, z = tr[y].p;
        if (z != k)
            if ((tr[y].s[1] == x) ^ (tr[z].s[1] == y)) rotate(x);
            else rotate(y);
        rotate(x);
    }
    if (!k) root = x;
}

int build(int l, int r, int p){
    int t = ++ idx;
    if(l == r)
        tr[t].init(a[l], p);
    else if(l == r - 1){
        tr[t].init(a[r], p);
        tr[t].s[0] = build(l, l, t);
    }
    else{
        int mid = (l + r) / 2;
        tr[idx].init(a[mid], p);
        tr[idx].s[0] = build(l, mid - 1, t);
        tr[idx].s[1] = build(mid + 1, r, t);
    }
    pushup(t);
    return idx;
}

int get_k(int k){
    int u=root;
    while(true){
        pushdown(u);
        if(tr[tr[u].s[0]].size>=k)u=tr[u].s[0];
        else if(tr[tr[u].s[0]].size+1==k)return u;
        else k-=tr[tr[u].s[0]].size+1,u=tr[u].s[1];
    }
    return -1;
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
        cin >> a[i];
    root = build(0, n + 1, 0);
    while (m -- ){
        cin >> opt;
        if(opt == 1){
            cin >> x >> y >> k;
            int L = get_k(x - 1), R = get_k(y + 1);
            splay(L, 0),splay(R, L);
            int u = tr[R].s[0];
            tr[u].flag += k;
            tr[u].v += k;
            tr[u].sum += tr[u].size * k;
            pushup(L);
        }
        else{
            cin >> x >> y;
            int L = get_k(x - 1), R = get_k(y + 1);
            splay(L, 0),splay(R, L);
            cout << tr[tr[R].s[0]].sum << endl;
        }
    }
    return 0;
}