# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
592920 | Luxry | 사탕 분배 (IOI21_candies) | C++17 | 5065 ms | 13272 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 <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
vector<int> s(c.size());
for (int j = 0; j < v.size(); ++j) {
if (v[j] > 0) {
for (int k = l[j]; k <= r[j]; ++k) {
s[k] = min(c[k], s[k] + v[j]);
}
}
else if (v[j] < 0) {
for (int k = l[j]; k <= r[j]; ++k) {
s[k] = max(0, s[k] + v[j]);
}
}
}
return s;
}
int solve()
{
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int q;
cin >> q;
vector<int> l(q), r(q), v(q);
for (int i = 0; i < q; ++i) {
cin >> l[i], r[i], v[i];
}
vector<int> result = distribute_candies(c, l, r, v);
for (int i = 0; i < n; ++i) {
cout << result[i] << " ";
}
}
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... |