Submission #438988

#TimeUsernameProblemLanguageResultExecution timeMemory
438988jlozano254Distributing Candies (IOI21_candies)C++17
0 / 100
130 ms8384 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;
    std::vector<int> dp(n + 1);

    for (int i = 0; i < (int) v.size(); ++i) {
        dp[l[i]] += v[i];
        dp[r[i] + 1] -= v[i];
    }

    for (int i = 1; i < (int) c.size(); ++i) dp[i] += dp[i - 1];

    for (int i = 0; i < (int) c.size(); ++i) s.push_back(std::min((int) dp[i], c[i]));

    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...