# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438753 | 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);
s.assign(n, 0);
for(int _=0;_<q;_++) {
int lo=l[_], hi=r[_];
for(int i=lo;i<=hi;i++) {
int k=s[i]+q[_];
if(q[_]>=0) { k=min(k, c[i]); }
else { k=max(0, k); }
s[i]=k;
}
}
return s;
}