# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440225 | BaraaArmoush | Distributing Candies (IOI21_candies) | C++17 | 106 ms | 19624 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int minimize(int& x, int y) {
if (x > y) {
x = y;
}
}
int maximize(int& x, int y) {
if (x < y) {
x = y;
}
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size();
int q = l.size();
vector<int> a(n);
for (int j = 0; j < q; j++) {
for (int i = l[j]; i <= r[j]; i++) {
a[i - 1] += v[j];
maximize(a[i - 1], 0);
minimize(a[i - 1], c[i - 1]);
}
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... |