Submission #1242318

#TimeUsernameProblemLanguageResultExecution timeMemory
1242318nibertDistributing Candies (IOI21_candies)C++20
3 / 100
5092 ms7240 KiB
#include <vector>
#include <algorithm>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    int n = c.size(), q = r.size();
    vector<int> prefix(n);
    for (int i =0; i < q; i++){
        int left = l[i], right = r[i], value = v[i];
        if (v[i] > 0){
            for(int idx = l[i]; idx <= r[i]; idx++){
                prefix[idx] = min(c[idx], prefix[idx]+v[i]);
            }
        } else{
            for(int idx = l[i]; idx <= r[i]; idx++){
                prefix[idx] = max(0, prefix[idx]+v[i]);
            }    
        }
    }
    return prefix;
}
#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...