# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064187 | glupan | 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 <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_N = 1000005;
const int INF = 1e9;
int n,q;
void solve() {
cin >> n;
int c[n];
for(int i=0; i<n; i++)
cin >> c[i];
cin >> q;
int l[q],r[q],v[q];
for(int i=0; i<q; i++)
cin >> l[i] >> r[i] >> v[i];
int s[n];
vector<int> pref(n+1,0);
for(int i=0; i<q; i++) {
pref[l[i]] += v[i];
pref[r[i]+1] -= v[i];
}
for(int i=1; i<=n; i++)
pref[i]+=pref[i-1];
for(int i=0; i<n; i++)
s[i] = min(c[i],pref[i]);
for(int i=0; i<n; i++)
cout << s[i] << " ";
cout << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t=1;
while(t--) solve();
return 0;
}