Submission #1242462

#TimeUsernameProblemLanguageResultExecution timeMemory
1242462nibertDistributing Candies (IOI21_candies)C++20
0 / 100
59 ms8004 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> prefix(n+1); vector<int> result(n); for (int i = 0; i < q; i++){ prefix[l[i]] += v[i]; prefix[r[i] + 1] -= v[i]; } for (int i = 1; i < n; i++) { prefix[i] += prefix[i - 1]; } for (int i = 0; i < n; i++) result[i] = min(c[i], max(0, prefix[i])); return result; }
#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...