# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834684 | 2023-08-22T17:06:17 Z | Mohmad_Zaid | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #include <bits/stdc++.h> #define ll long long using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) { int n = c.size(); int q=l.size(); vector<ll> s(n,0); for(int i=0;i<q;i++){ for(int j=l[i];j<=r[i];j++){ if(v[i]>0){ s[j]=min((ll)c[j],s[j]+v[i]); }else{ s[j]=max((ll)0,s[j]-v[i]); } } } vector<int>ans; for(int i=0;i<n;i++){ ans.pb(min((ll)c[i],s[i])); } return ans; }