# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502333 | BeefcakeCat | 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<fstream>
using namespace std;
int n = 1, q = 1;
int* distribute_candies(int c[], int l[], int r[], int v[])
{
static int s[200000] = {0};
for(int i = 0; i < q; i++)
{
for(int j = l[i]; j <= r[i]; j++)
{
s[j] += v[i];
if(s[j] > c[j])
{
s[j] = c[j];
}
else if(s[j] < 0)
{
s[j] = 0;
}
}
}
return s;
}
int main()
{
ifstream fin ("candies.in");
ofstream fout ("candies.out");
fin >> n;
int c[n];
int* s;
for (int i = 0; i < n; i++)
{
fin >> c[i];
}
fin >> q;
int l[q], r[q], v[q];
for (int i = 0; i < q; i++)
{
fin >> l[i] >> r[i] >> v[i];
}
s = distribute_candies(c, l, r, v);
for(int i = 0; i < n; i++)
{
fout << s[i] << " ";
}
}