# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824780 | andrei_boaca | Distributing Candies (IOI21_candies) | C++17 | 88 ms | 13764 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;
typedef long long ll;
int n,q;
vector<ll> v;
vector<int> sol;
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);
sol.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];
}
}
for(int i=0;i<v.size();i++)
sol[i]=v[i];
return sol;
}
bool ok=1;
for(int i=0;i<vals.size();i++)
if(vals[i]<0)
ok=0;
if(ok)
{
for(int z=0;z<vals.size();z++)
{
int l=stanga[z];
int r=dreapta[z];
int val=vals[z];
v[l]+=val;
if(r+1<n)
v[r+1]-=val;
}
ll suma=0;
for(int i=0;i<n;i++)
{
suma+=v[i];
sol[i]=min(suma,1LL*c[i]);
}
return sol;
}
return sol;
}
Compilation message (stderr)
# | 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... |