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 ve vector<int>
using namespace std;
ve ans;
ve distribute_candies(ve c, ve l, ve r, ve v){
int n =c.size() , q = v.size();
ans.resize(n , 0);
for(int i = 0; i < q; ++i){
ans[l[i]] += v[i];
ans[r[i] + 1] -= v[i];
}
for(int i = 1; i < n; ++i) ans[i] += ans[i - 1];
for(int i = 0;i < n; ++i) ans[i] = min(ans[i] , c[i]);
return ans;
}
# | 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... |