# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564770 | ngano_upat_na | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cmath>
#include <vector>
#include "candies.h"
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(), q = l.size();
vector<int> ans(n,0);
for (int i=0; i<q; i++) {
for (int j=l[i]; j<=r[i]; j++) {
ans[j] = ((v[i] > 0) ? min(c[j], ans[j]+v[i]) : max(0, ans[j]+v[i]));
}
}
return ans;
}
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];
}
vector<int> ans = distribute_candies(c, l, r, v);
for (int i=0; i<n; i++) {
cout << ans[i];
if (i != n-1) cout << ' ';
}
}