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 <vector>
#include <bits/stdc++.h>
using namespace std;
int bound(int a, int b)
{
if (a<0)
return 0;
if (a>b)
return b;
return a;
}
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n = c.size();
std::vector<int> s(n, 0);
int q = v.size();
for (int i=0; i<q; i++)
{
for (int j=l[i]; j<=r[i]; j++)
{
if (v[i]>0)
{
s[j] = min(c[j], s[j]+v[i]);
}
else
{
s[j] = max(0, s[j]+v[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... |