# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436322 | gromperen | 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 "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) {
int n = c.size();
int q = l.size();
vector<int> s(n);
vector<long long> pre(n+1);
for (int i = 0; i < q; ++i) {
pre[l[i]] += v;
pre[r[i]+1] -= v;
}
for (int i = 0; i < n; ++i) {
if (i > 0) pre[i] += pre[i-1];
s[i] = max(pre[i], 1LL * c[i]);
}
return s;
}