| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 480622 | Haidara | 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<bits/stdc++.h>
#include<candies.h>
#define intt long long
using namespace std;
vector<int> distribute_candies(vector<intt> c,vector<intt> l,vector<intt> r, vector<intt> v)
{
vector<intt>a((int)c.size(),0);
for(int i=0;i<(int)l.size();i++)
for(int j=l[i];j<=r[i];j++)
if(v[i]>0)
a[j]=min(a[j]+v[i],c[j]);
else
a[j]=max((intt)0,a[j]-v[i]);
return vector<int>(a.begin(),a.end());
}