# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1052839 | 2024-08-11T04:29:03 Z | amongus_pvp | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> 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(); // Initialize the difference array with zeroes vector<int> diff(n + 1, 0); for (int j = 0; j < q; ++j) { diff[l[j]] += v[j]; if (r[j] + 1 < n) { diff[r[j] + 1] -= v[j]; } } // Calculate the actual number of candies in each box vector<int> s(n, 0); int current = 0; for (int i = 0; i < n; ++i) { current += diff[i]; s[i] = min(max(current, 0), c[i]); } return s; }