# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438755 | MohamedFaresNebili | 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 "candies.h"
#include <vector>
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(); int q = v.size();
std::vector<int> s(n);
for(int i=0;i<n;i++) s[i]=0;
for(int i=0;i<q;i++) {
int lo=l[i], hi=r[i];
for(int k=lo;k<=hi;k++) {
if(v[i]>0) { s[k]=min(v[i]+s[k], c[k]); }
else { s[k]=max(v[i]+s[k], 0); }
}
}
return s;
}