# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469789 | FirasMesbeh | 사탕 분배 (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>
using namespace std;
const int N=20005;
int c[N]; int v[N]; int l[N]; int r[N]; int a[N];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n; cin>>n;
for(int i=0;i<n;i++) cin>>c[i];
int q;
cin>>q;
for(int i=0;i<q;i++) cin>>l[i]>>r[i]>>v[i];
for(int i=0;i<q;i++)
{
for(int j=l[i];j<=r[i];j++)
{
if(v[i]>0) a[j]=min(c[j],a[j]+v[i]);
else a[j]=max(0,a[j]+v[i]);
}
}
for(int i=0;i<n;i++) cout<<a[i]<<' ';
}