Submission #441821

#TimeUsernameProblemLanguageResultExecution timeMemory
441821alan8585Distributing Candies (IOI21_candies)C++17
8 / 100
139 ms10692 KiB
#include "candies.h"

#include <vector>
using namespace std;

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(), q = l.size();
    std::vector<int> s(n);
    vector<long long> pre(n + 1);
    for(int i = 0; i < q; i++) {
        pre[l[i]] += v[i];
        pre[r[i] + 1] -= v[i];
    }
    long long now = 0;
    for(int i = 0; i < n; i++) {
        now += pre[i];
        s[i] = min(now, (long long)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...