# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894871 | Sir_Ahmed_Imran | 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.
///~~~LOTA~~~///
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define N 300001
vector<ll> distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v){
ll o,p,q;
vector<ll> x,y;
for(int i=o=0;i<c.size();i++)
y.append(0);
for(int i=0;i<l.size();i++){
p=v[i];
for(int j=l[i];j<=r[i];j++){
q=c[j];
if(v[i]>0) o+=min(p,q-y[j]);
else o+=max(p,-y[j]);
y[j]=max(0LL,min(q,y[j]+p));
}
x.append(o);
}
return x;
}