# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894841 | Muhammad_Aneeq | Distributing Candies (IOI21_candies) | C++17 | 5027 ms | 9300 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 <vector>
using namespace std;
int const N=2e5+10;
int n;
vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v)
{
n=c.size();
bool w=0;
for (auto i:v)
if (i<0)
w=1;
if (w==0)
{
vector<long long>d(n+1,0);
for (int i=0;i<l.size();i++)
{
d[l[i]]+=v[i];
d[r[i]+1]-=v[i];
}
vector<int>ans;
ans.push_back(d[0]);
for (int i=1;i<n;i++)
ans.push_back(d[i]-ans.back());
for (int i=0;i<n;i++)
{
ans[i]=(ans[i]<0?0:ans[i]);
ans[i]=min(c[i],ans[i]);
}
return ans;
}
vector<int>ans(n,0);
for (int i=0;i<l.size();i++)
{
for (int j=l[i];j<=r[i];j++)
{
ans[j]+=v[i];
ans[j]=min(ans[j],c[j]);
ans[j]=(ans[j]<0?0:ans[j]);
}
}
return ans;
}
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... |