# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941792 | Numberz | Distributing Candies (IOI21_candies) | C++17 | 5077 ms | 13268 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>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int q = l.size();
vector<int> ans(c.size(), 0);
for (int k = 0; k < c.size(); k++) {
//we go through each box and now perform the check on each
for (int day = 0; day < q; day++) {
//if l r constraints
if (k >= l[day] && k <= r[day]) {
if (v[day] > 0) {
ans[k] = min(c[k], ans[k] + v[day]);
}
else {
ans[k] = max(0, ans[k] + v[day]);
}
}
}
}
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... |