# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480610 | 2021-10-17T12:40:28 Z | Haidara | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include<grader.h> using namespace std; vector<int> distribute_candies(vector<int> c,vector<int> l,vector<int> r, vector<int> v) { int n=l.size(); vector<int>res(c.size()); for(int i=0;i<n;i++) { for(int j=l[i];j<=r[i];j++) { if(v[i]>0) res[j]=min(res[j]+v[i],c[j]); else res[j]=max(0,res[j]-v[i]); } } return res; }