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>
#include "candies.h"
using namespace std;
const int maxn = 2e5+10;
int value(int v, int add, int C)
{
if (add + v > C) return C;
if (add + v < 0) return 0;
return add+v;
}
int a[maxn];
vector<int> distribute_candies(vector<int> c, vector<int> L, vector<int> R, vector<int> V)
{
int n = c.size(), q = L.size();
for (int i = 0; i < q; i++)
{
for (int j = L[i]; j <= R[i]; j++)
a[j] = value(a[j], V[i], c[j]);
}
vector<int> ans;
for (int i = 0; i < n; i++)
ans.push_back(a[i]);
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... |