# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924860 | Programmer123 | Distributing Candies (IOI21_candies) | C++17 | 82 ms | 9040 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "candies.h"
#include <bits/stdc++.h>
typedef std::vector<int> ivec;
#define int long long
ivec distribute_candies(ivec c, ivec l,
ivec r, ivec v) {
int N = c.size();
int Q = l.size();
ivec ans(N);
if (N * Q <= 2000 * 2000) {
for (int i = 0; i < N; ++i) {
int val = 0;
for (int j = 0; j < Q; ++j) {
if (l[j] > i || r[j] < i) continue;
val += v[j];
if (val < 0) val = 0;
if (val > c[i]) val = c[i];
}
ans[i] = val;
}
return ans;
}
bool pos = true;
for (int i = 0; i < Q; ++i) {
if (v[i] < 0) pos = false;
}
if (pos) {
int diff[N + 1];
for (int i = 0; i <= N; ++i) {
diff[i] = 0;
}
for (int i = 0; i < Q; ++i) {
diff[l[i]] += v[i];
diff[r[i] + 1] -= v[i];
}
for (int i = 1; i <= N; ++i) {
diff[i] += diff[i - 1];
}
for (int i = 0; i < N; ++i) {
ans[i] = (signed) std::min<int>(diff[i], c[i]);
}
return ans;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |