# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435153 | 2021-06-23T04:20:04 Z | MinhQNgo | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include "candies.h" #include <bits/stdc++.h> using namespace std; 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(); int q = l.size(); std::vector<int> s(n); for (int time = 0; time < q; time++) { int L = l[time], R = r[time], V = v[time]; for (int i = L; i <= R; i++) a[i] += V; } for (int i = 0; i < n; i++) s[i] = a[i]; return s; }