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;
typedef long long ll;
typedef vector<int> vi;
#define sz(x) (int)(x).size()
int N, Q;
std::vector<int> distribute_candies(vi c, vi l,
vi r, vi v)
{
N = sz(c);
Q = sz(l);
vi S(N, 0);
for (int q = 0; q < Q; ++q)
{
for (int i = l[q]; i <= r[q]; ++i)
{
S[i] += v[q];
S[i] = max(S[i], 0);
S[i] = min(S[i], c[i]);
}
}
return S;
}
# | 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... |