Submission #535404

#TimeUsernameProblemLanguageResultExecution timeMemory
535404pokmui9909Distributing Candies (IOI21_candies)C++17
3 / 100
5087 ms13264 KiB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, Q;
vector<int> a;

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();
    a.resize(N);

    for(int i = 0; i < Q; i++){
        for(int j = l[i]; j <= r[i]; j++){
            a[j] += v[i];
            a[j] = min(a[j], c[j]);
            a[j] = max(a[j], 0);
        }
    }
    return a;
}
#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...