361C - Levko and Array Recovery - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define ld long double

using namespace std;

struct Data {
    int t;
    int l;
    int r;
    int x;
};

int32_t main() {
    int n, m;
    cin >> n >> m;
    vector<Data> a(m);
    vector<int> res(n, -1e9);
    for (int i = 0; i < m; i++) {
        int t, l, r, x;
        cin >> t >> l >> r >> x;
        l--;
        r--;
        a[i].t = t;
        a[i].l = l;
        a[i].r = r;
        a[i].x = x;
        if (t == 2) {
            bool go = false;
            for (int j = l; j <= r; j++) {
                if (res[j] == -1e9 || res[j] >= x) {
                    res[j] = x;
                    go = true;
                }
            }
            if (!go) {
                cout << "NO";
                return 0;
            }
        } else {
            for (int j = l; j <= r; j++) {
                if (res[j] != -1e9) {
                    res[j] += x;
                }
            }
        }
    }
    for (int i = m - 1; i >= 0; i--) {
        if (a[i].t == 1) {
            for (int j = a[i].l; j <= a[i].r; j++) {
                res[j] -= a[i].x;
            }
        } else {
            int max1 = -1e9;
            for (int j = a[i].l; j <= a[i].r; j++) {
                max1 = max(max1, res[j]);
            }
            if (max1 != a[i].x) {
                cout << "NO";
                return 0;
            }
        }
    }
    cout << "YES" << '\n';
    for (int i : res) {
        if (i <= -1e9) {
            cout << 1000000000 << ' ';
        } else {
            cout << i << ' ';
        }
    }
    return 0;
}