Submission #1243222

#TimeUsernameProblemLanguageResultExecution timeMemory
1243222nibertDistributing Candies (IOI21_candies)C++20
8 / 100
61 ms9032 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<long long> boxes(n, 0); for (int i = 0; i < q; i++){ int left = l[i], right = r[i], value = v[i]; boxes[left] += value; if (right + 1 < n) { boxes[right + 1] -= value; } } for (int i = 1; i < n; i++) { boxes[i] += boxes[i - 1]; } vector<int> res(n); for (int i = 0; i < n; i++){ long long val = min(1LL * c[i], boxes[i]); res[i] = (int)val; } return res; }
#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...