Submission #530217

#TimeUsernameProblemLanguageResultExecution timeMemory
530217Icebear16Distributing Candies (IOI21_candies)C++17
0 / 100
99 ms12880 KiB
#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){ if(c[i]>(s[i]+v[j])) s[i]=c[i]; s[i]=s[i]+v[j]; }else{ if(0>(s[i]+v[j])) s[i]=0; s[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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...