# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058594 | qwusha | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 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;
#define fi first
#define se second
typedef long double ld;
const ld eps = 1e-8;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const ll inf = 1e18;
const ll mod = 1e9 + 7;
#include "candies.h"
vector<int> distribute_candies(vector<int> &c, vector<int> &l, vector<int> &r, vector<int> &v) {
int n = c.size();
vector<int> res(n);
for (int qw = 0; qw < l.size(); qw++) {
for (int i = l[qw]; i <= r[qw]; i++) {
if (v[qw] > 0) {
res[i] = min(res[i] + v[qw], c[i]);
} else {
res[i] = max(res[i] - v[qw], 0);
}
}
}
return res;
}