# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436402 | PiejanVDC | Distributing Candies (IOI21_candies) | C++17 | 151 ms | 8028 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>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
vector<int>sum(c.size()+1,0);
for(int i = 0 ; i < v.size() ; i++) {
sum[l[i]]+=v[i],sum[r[i]+1]-=v[i];
}
vector<int>ans(c.size());
ans[0]=sum[0];
int current_sum=sum[0];
for(int i = 1 ; i < c.size() ; i++) {
current_sum-=(sum[i-1]-sum[i]);
ans[i] = min(c[i],current_sum);
}
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... |