# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480622 | 2021-10-17T12:58:36 Z | Haidara | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include<candies.h> #define intt long long using namespace std; vector<int> distribute_candies(vector<intt> c,vector<intt> l,vector<intt> r, vector<intt> v) { vector<intt>a((int)c.size(),0); for(int i=0;i<(int)l.size();i++) for(int j=l[i];j<=r[i];j++) if(v[i]>0) a[j]=min(a[j]+v[i],c[j]); else a[j]=max((intt)0,a[j]-v[i]); return vector<int>(a.begin(),a.end()); }