#include "candies.h"
#include <vector>
#include <algorithm>
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){
// if(c[i]>(s[i]+v[j])) s[i]+=v[j];
// else s[i]=c[i];
// }else{
// if((s[i]+v[j])<0) s[i]=0;
// else s[i]+=v[j];
// }
// }
// }
// }else{
s.push_back(0);
int h=0,k=0;
for(int j=0;j<q;j++){
h=l[j];
s[h]+=v[j];
k=r[j]+1;
s[k]-=v[j];
}
for(int i=1;i<=n;i++){
s[i]+=s[i-1];
}
s.pop_back();
for(int i=0;i<n;i++){
if(s[i]>c[i]){
s[i]=c[i];
}
}
// }
return s;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
97 ms |
8884 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |