Submission #570940

#TimeUsernameProblemLanguageResultExecution timeMemory
570940sff_userDistributing Candies (IOI21_candies)C++17
0 / 100
114 ms7836 KiB
#include <vector>
#include<bits/stdc++.h>

#define ll long long

using namespace std;


vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    int n = c.size();
    int q = l.size();
    
    vector<int> diff(n,0);
    for(int i = 0 ;i < q ; i++){
        diff[l[i]]+=v[i];
        if(r[i]+1<n) diff[r[i]+1]-=v[i];
    }
    for(int i = 1  ;i < n ; i++) diff[i]+=diff[i-1];
    for(int i = 0 ; i < n ; i++) diff[i]=min(diff[i],c[i]);
    return diff;
}

#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...