下载的数据本地可以跑出来，但是交上去就RE。
求调

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) ((x) & - (x))
#define ull unsigned long long

const int INF = 0x3f3f3f3f3f3f3f3fLL;
const int N = 2e5 + 5;

struct node {
    int op, l, r, c, id;
} q[N], q1[N], q2[N];

int a[N];
int ans[N];

int tree[N << 2];
int tag[N << 2];

int ls(int p) {return p << 1;}
int rs(int p) {return p << 1 | 1;}

int n;

int push_up(int p) {
    tree[p] = tree[ls(p)] + tree[rs(p)];
}

void addtag(int p, int l, int r, int d) {
    tree[p] += d * (r - l + 1);
    tag[p] += d;
}

void push_down(int p, int l, int r) {
    if (tag[p]) {
        int mid = (l + r) >> 1;
        addtag(ls(p), l, mid, tag[p]);
        addtag(rs(p), mid + 1, r, tag[p]);
        tag[p] = 0;
    }
}

void update(int L, int R, int p, int l, int r, int d) {
    if (L <= l && r <= R) {
        addtag(p, l, r, d);
        return ;   
    }
    push_down(p, l, r);
    int mid = (l + r) >> 1;
    if (L <= mid)
        update(L, R, ls(p), l, mid, d);
    if (mid < R)
        update(L, R, rs(p), mid + 1, r, d);
    push_up(p);
}

int query(int L, int R, int p, int l, int r) {
    if (L <= l && r <= R) {
        return tree[p];
    }
    push_down(p, l, r);
    int res = 0;
    int mid = (l + r) >> 1;
    if (L <= mid)
        res += query(L, R, ls(p), l, mid);
    if (mid < R)
        res += query(L, R, rs(p), mid + 1, r);   
    return res;
}

void work(int L, int R, int l, int r) {
    if (L > R)
        return ;
    if (l == r) {
        for (int i = L; i <= R; i++) {
            if (q[i].op == 2) {
                ans[q[i].id] = l - n - 1;
            }
        }
        return ;
    }
    
    int mid = (l + r + 1) >> 1;
    int cnt1 = 0, cnt2 = 0;
    for (int i = L; i <= R; i++) {
        if (q[i].op == 1) {
            if (q[i].c >= mid) {
                update(q[i].l, q[i].r, 1, 1, n, 1);
                q2[++cnt2] = q[i];
            } else {
                q1[++cnt1] = q[i];
            }
        } else {
            int x = query(q[i].l, q[i].r, 1, 1, n);
            if (q[i].c <= x) {
                q2[++cnt2] = q[i];
            } else {
                q[i].c -= x;
                q1[++cnt1] = q[i];
            }
        }
    }

    for (int i = 1; i <= cnt2; i++) {
        if (q2[i].op == 1) {
            update(q2[i].l, q2[i].r, 1, 1, n, -1);
        }
    }

    for (int i = 1; i <= cnt1; i++) {
        q[L + i - 1] = q1[i];
    }
    for (int i = 1; i <= cnt2; i++) {
        q[L + cnt1 + i - 1] = q2[i];
    }

    work(L, L + cnt1 - 1, l, mid - 1);
    work(L + cnt1, R, mid, r);
}

void solve() {
    int m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        ans[i] = -INF;
    }
    int cnt = 0;
    for (int i = 1; i <= m; i++) {
        int op, l, r, c;
        cin >> op >> l >> r >> c;
        if (op == 1)
            c += n + 1;
        q[++cnt] = {op, l, r, c, i};
    }
    work(1, cnt, 1, 2 * n + 1);

    for (int i = 1; i <= m; i++) {
        if (ans[i] != -INF) {
            cout << ans[i] << '\n';
        }
    }
    // cout << "Debug!\n";
    return ;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;

    while (t--)
        solve();
    return 0;
}