# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436421 | PiejanVDC | 사탕 분배 (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;
vector<int64_t> distribute_candies(vector<int64_t> c, vector<int64_t> l, vector<int64_t> r, vector<int64_t> v) {
vector<int64_t>sum(c.size()+1,0);
for(int32_t i = 0 ; i < v.size() ; i++) {
sum[l[i]]+=v[i],sum[r[i]+1]-=v[i];
}
vector<int64_t>ans(c.size());
int64_t current_sum=0;
for(int32_t i = 0 ; i < c.size() ; i++) {
current_sum+=sum[i];
ans[i] = min(c[i],current_sum);
}
return ans;
}