Submission #1221486

#TimeUsernameProblemLanguageResultExecution timeMemory
1221486HappyCapybaraDistributing Candies (IOI21_candies)C++17
3 / 100
5095 ms7240 KiB
#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){
    int n = c.size(), q = l.size();
    vector<int> res(n, 0);
    for (int i=0; i<q; i++){
        for (int j=l[i]; j<=r[i]; j++) res[j] = max(0, min(c[j], res[j]+v[i]));
    }
    return res;
}
#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...