Submission #1030614

#TimeUsernameProblemLanguageResultExecution timeMemory
1030614MardonbekhazratovDistributing Candies (IOI21_candies)C++17
3 / 100
5089 ms13388 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);
    for(int i=0;i<q;i++){
        for(int j=l[i];j<=r[i];j++){
            ans[j]+=v[i];
            ans[j]=max(0,min(c[j],ans[j]));
        }
    }
    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...