# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680834 | 2023-01-11T21:06:35 Z | Gabriel | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #include <bits/stdc++.h> vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){ int n = c.size(); vector<int> s(n, 0); int aa = 0; while(aa != v.size()){ int bb = l[aa]; while(bb <= r[aa]){ if(v[aa] > 0) s[bb] = min(c[bb], s[bb] + v[aa]); else s[bb] = max(0, s[bb] + v[aa]); bb++; } aa++; } return s; }