Submission #440371

#TimeUsernameProblemLanguageResultExecution timeMemory
440371antontsiorvasDistributing Candies (IOI21_candies)C++17
8 / 100
145 ms14488 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); std::vector<long long int> ps(n), cand(n+1); for(int i=0; i<q; i++){ cand[l[i]] += v[i]; cand[r[i]+1] -= v[i]; } ps[0] = cand[0]; for(int i=1; i<n; i++){ cand[i] += cand[i-1]; ps[i] = cand[i]; } for(int i=0; i<n; i++) ps[i] = std::min((long long int) c[i],ps[i]); for(int i=0; i<n; i++) s[i] = ps[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...