# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
490824 | Karuk | 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>
using namespace std;
vector<int> distribute_candies(int c[], int l[], int r[], int v[])
{
int n=sizeof(c);
int q=sizeof(l);
vector<int>ans(n,0);
for(int i=0;i<q;i++)
{
for(int j=l[i];j<=r[i];j++)
{
if(v[i]>0)ans[j]=min(c[i],ans[j]+v[i]);
else ans[j]=max(0,ans[j]+v[i]);
}
}
return ans;
}