# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530214 | Icebear16 | 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>
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();
std::vector<int> s(n,0);
bool flag=true;
for(int i=0;i<q;i++){
if(v[i]<0){
flag=false;
break;
}
}
if(flag==false){
for(int j=0;j<q;j++){
for(int i=l[j];i<=r[j];i++){
if(v[j]>=0){
s[i]=max(c[i],s[i]+v[j]);
}else{
s[i]=max(c[i],s[i]+v[j]);
}
}
}
}else{
s.push_back(0);
for(int j=0;j<q;j++){
s[l[j]]+=v[j];
s[r[j+1]]-=v[j];
}
for(int i=1;i<=n;i++){
s[i]+=s[i-1];
}
reverse(s.begin(),s.end());
s.pop_back();
reverse(s.begin(),s.end());
}
return s;
}