# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436579 | shrimb | Distributing Candies (IOI21_candies) | C++17 | 125 ms | 8036 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"
// #define int long long
#define endl '\n'
using namespace std;
vector<int> distribute_candies (vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size();
int q = l.size();
bool st1 = (n <= 2000 and q <= 2000);
bool st2 = 1; for (int i = 0 ; i < q ; i++) if (v[i] < 0) st2 = 0;
if (st1) {
vector<int> ret(n, 0);
for (int i = 0 ; i < q ; i++) {
for (int j = l[i] ; j <= r[i] ; j++) {
ret[j] = max(0, min(c[j], ret[j] + v[i]));
}
}
return ret;
}
if (st2) {
vector<int> ret(n, 0);
vector<int> pref(n + 1, 0);
for (int i = 0 ; i < q ; i++) {
pref[l[i]] += v[i];
pref[r[i] + 1] -= v[i];
}
for (int i = 1 ; i < n ; i++) pref[i] += pref[i-1];
for (int i = 0 ; i < n ; i++) ret[i] = min(c[i], pref[i]);
return ret;
}
}
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... |