# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1052842 | amongus_pvp | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// Function that takes vectors by const reference to avoid copying and improve efficiency
vector<int> distribute_candies(const vector<int>& c, const vector<int>& l, const vector<int>& r, const 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;
}