# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798824 | khshg | 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 <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
int Q = (int)L.size(), N = (int)C.size();
vector<long long> ans(N);
for(int i = 0; i < Q; ++i) {
ans[L[i]] += V[i];
if(R[i] + 1 < N) ans[R[i] + 1] -= V[i];
}
for(int i = 1; i < N; ++i) {
ans[i] += ans[i - 1];
}
for(int i = 0; i < N; ++i) {
ans[i] = min(ans[i], (long long)C[i]);
}
return ans;
}