| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1241936 | hayford08 | Distributing Candies (IOI21_candies) | C++20 | 0 ms | 0 KiB | 
#include <iostream>
#include <vector>
using namespace std;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    vector<int> prefix(n + 1, 0);
    int numQueries = l.size();
    for (int i = 0; i < numQueries; i++) {
        int left = l[i], right = r[i], value = v[i];
        prefix[left] += value;
        prefix[right + 1] -= value;
    }
    for (int i = 1; i <= n; i++) {
        prefix[i] += prefix[i - 1];
    }
    vector<int> res(n);
    for (int i = 0; i < n; i++) {
        res[i] = min(c[i], prefix[i]);
    }
    return res;
}
int main() {
    int n;
    cin >> n;
    vector<int> c(n);
    for (int i = 0; i < n; i++) {
        cin >> c[i];
    }
    int q;
    cin >> q;
    vector<int> l(q), r(q), v(q);
    for (int i = 0; i < q; i++) {
        cin >> l[i] >> r[i] >> v[i];
    }
    for (int x : distribute_candies(c, l, r, v)) {
        cout << x << " ";
    }
    cout << endl;
    return 0;
}
