Submission #1030617

#TimeUsernameProblemLanguageResultExecution timeMemory
1030617MardonbekhazratovDistributing Candies (IOI21_candies)C++17
0 / 100
68 ms8020 KiB
#include "candies.h"

#include <vector>

using namespace std;

int n, q;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
    n = c.size();
    q = l.size();
    vector<int>ans(n,0),sum(n+1,0);
    for(int i=0;i<q;i++){
        sum[l[i]]+=v[i];
        sum[r[i]+1]-=v[i];
    }
    for(int i=0;i<n;i++){
        if(i>0) sum[i]+=sum[i-1];
        ans[i]=min(sum[i],c[i]);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...