Submission #75953766

---

Source Code Expand

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

#define ll long long
#define endl '\n'

class Solution {
public:

    // ek test solve
    void solve() {

        int n, q;
        cin >> n >> q;

        vector<ll> s(n);

        // initial battery
        for (int i = 0; i < n; i++) cin >> s[i];

        // diff array for range add
        vector<ll> diff(n + 2, 0);

        // har query ka mark
        for (int i = 0; i < q; i++) {
            int l, r;
            cin >> l >> r;

            diff[l - 1] += 1;
            diff[r] -= 1;
        }

        // prefix sum bana ke final count nikaal rahe
        ll cur = 0;

        for (int i = 0; i < n; i++) {
            cur += diff[i];

            // battery zero se niche nahi ja sakti
            ll ans = max(0LL, s[i] - cur);

            cout << ans << " ";
        }

        cout << endl;
    }
};

int main() {
    Solution obj;
    obj.solve();

    return 0;
}

Submission Info

Judge Result