This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// without pragmas
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
#include "candies.h"
vi distribute_candies(vi C, vi L, vi R, vi V) {
int N = C.size();
int Q = V.size();
vi ans(N, 0);
for (int i = 0; i < Q; i++) {
for (int j = L[i]; j <= R[i]; j++) {
ans[j] += V[i];
ans[j] = max(ans[j], 0);
ans[j] = min(ans[j], C[j]);
}
}
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... |