| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1369370 | avighna | Distributing Candies (IOI21_candies) | C++20 | 45 ms | 8872 KiB |
#include <bits/stdc++.h>
using namespace std;
namespace {
using int64 = long long;
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
const int n = c.size(), q = v.size();
vector<int64> d(n + 1);
for (int i = 0; i < q; ++i) {
d[l[i]] += v[i], d[r[i] + 1] -= v[i];
}
partial_sum(d.begin(), d.end(), d.begin());
vector<int> ans(n);
for (int i = 0; i < n; ++i) {
ans[i] = min(d[i], int64(c[i]));
}
return ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
