Submission #440366

#TimeUsernameProblemLanguageResultExecution timeMemory
440366antontsiorvasDistributing Candies (IOI21_candies)C++17
3 / 100
5095 ms12052 KiB
#include "candies.h" #include <cstdio> #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(), q = l.size(); std::vector<int> s(n); for(int i=0; i<q; i++){ for(int j=l[i]; j<=r[i]; j++){ if(v[i] > 0) s[j] = std::min(c[j],s[j]+v[i]); else s[j] = std::max(0,s[j]+v[i]); } } 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...