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 n = c.size(), q = v.size();
int cur = 0, mx = 0, mn = INT_MAX;
for (int i = 0; i < q; ++i) {
cur += v[i];
if (mx < cur) {
mx = cur;
mn = mx;
}
mn = min(mn, cur);
if (cur <= 0) {
cur = 0, mx = 0, mn = INT_MAX;
}
//cout << cur << ' ' << mx << ' ' << mn << "\n";
}
vector<int> ans;
for (int i = 0; i < n; ++i) {
ans.push_back(cur - max(0, min(mx - c[i], mn)));
}
return ans;
}
# | 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... |