# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966108 | 2024-04-19T11:55:32 Z | AkibAzmain | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #include <bits/stdc++.h> using namespace std; std::vector<int> distribute_candies (std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { ll n = c.size(), q = v.size (); vector < int > s (n); for (int i = 0; i < q; ++i) for (int j = l[i]; j <= r[i]; ++j) s[i] += v[i], s[i] = max (s[i], 0), s[i] = min (s[i], c[i]); return s; }