Submission #75825911

---

Source Code Expand

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int N, Q; cin >> N >> Q;
    vector<array<int,4>> qv;
    for (int q = 0; q < Q; q++) {
        int t; cin >> t;
        if (t == 1) {
            int a; cin >> a;
            qv.push_back({ t, a, 0, 0 });
        }
        else {
            int a, b, c; cin >> a >> b >> c;
            qv.push_back({ t, a, b, c });
        }
    }
    reverse(all(qv));
    vector<int> vis(N+1);
    int ans = 0;
    int m = 0, s = 0, t = 0, cnt = 0;
    for (auto [ty, a, b, c] : qv) {
        if (ty == 2) {
            int rs = s-c;
            if (rs < 0) {
                s = c;
                if (t+rs >= 0) t += rs;
                else t = 0;
                rs = 0;
            }
            if (m == 0) {
                if (t > 0) m++, t--;
                else if (s >= 1) {
                    m++;
                    if (rs > 0) {
                        rs--; s--;
                    }
                }
            }
            int rm = m-a;
            if (rm < 0) {
                m = a;
                if (t+rm >= 0) t += rm;
                else t = 0;
                rm = 0;
            }
            int rt = rm+rs+t - b;
            if (rt < 0) {
                t -= rt;
                rt = 0;
            }
            rt = min(rt, t);
            ans = max(ans, m+s+(t - min(rt, cnt)));
        }
        else {
            if (!vis[a]) {
                vis[a] = 1;
                t++; cnt++;
            }
        }
    }
    cout << (ans > N ? -1 : ans) << "\n";
    return 0;
}

Submission Info

Judge Result