# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835347 | azatega | 사탕 분배 (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 <vector>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l,
vector<int> r, vector<int> v) {
int n = c.size();
vector<int> s(n);
if(n <= 2000){
for(int i = 0; i < n; i++){
for(int j = 0; j < v.size(); j++){
if(i >= l[j] && i <= r[j]){
s[i] += v[j];
s[i] = max(s[i], 0);
s[i] = min(s[i], c[i]);
}
}
}
}else{
vector<long long> ch(n+5);
for(int j = 0; j < v.size(); j++){
ch[l[j]] += v[j];
ch[r[j] + 1] -= v[j];
}
long long curr = 0;
for(int i = 0; i < n; i++){
curr += ch[i];
s[i] = min(c[i], curr);
}
}
return s;
}