# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824776 | andrei_boaca | 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 "candies.h"
#include <bits/stdc++.h>
#include <vector>
#include "grader.cpp"
using namespace std;
int n,q;
vector<int> v;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> stanga,std::vector<int> dreapta, std::vector<int> vals)
{
n = c.size();
q=stanga.size();
v.resize(n);
if(n<=2000&&q<=2000)
{
for(int z=0;z<stanga.size();z++)
{
int l=stanga[z];
int r=dreapta[z];
int val=vals[z];
for(int i=l;i<=r;i++)
{
v[i]+=val;
if(v[i]<0)
v[i]=0;
if(v[i]>c[i])
v[i]=c[i];
}
}
return v;
}
return v;
}