제출 #526055

#제출 시각아이디문제언어결과실행 시간메모리
526055benjaminkleynDistributing Candies (IOI21_candies)C++17
3 / 100
5071 ms13200 KiB
#include "candies.h"
#include <vector>

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    std::vector<int> s(n);
    int q = l.size();

    // subtask 1
    for (int j = 0; j < q; j++)
        for (int k = l[j]; k <= r[j]; k++)
            s[k] += v[j], s[k] = std::max(s[k], 0), s[k] = std::min(s[k], c[k]);

    return s;
}
#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...