Submission #1243016

#TimeUsernameProblemLanguageResultExecution timeMemory
1243016nibertDistributing Candies (IOI21_candies)C++20
0 / 100
63 ms7332 KiB
#include <vector> #include <algorithm> using namespace std; vector<int> distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v) { int n = c.size(), q = r.size(); vector<int> boxes(n, 0); for (int i = 0; i < q; i++){ int left = l[i], right = r[i], value = v[i]; if (right + 1 < n) { boxes[left] += value; boxes[right + 1] -= value; } else { boxes[left] += value; } } for (int i = 1; i < n; i++){ boxes[i] += boxes[i - 1]; boxes[i-1] = min(c[i-1], boxes[i - 1]); } boxes[n - 1] = min(c[n - 1], boxes[n - 1]); return boxes; }
#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...