Submission #436130

#TimeUsernameProblemLanguageResultExecution timeMemory
436130Mohammed_AtalahDistributing Candies (IOI21_candies)C++17
0 / 100
134 ms9680 KiB
#include "candies.h"
#include <bits/stdc++.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 box = c.size();

    vector<int> partial;
    partial.resize(box + 1);

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

    vector<int> cum;
    cum.resize(box);
    cum[0] = partial[0];
    for (int i = 1; i < box; i++) {
        cum.push_back(cum[i - 1] + partial[i]);
    }


    vector<int> res;
    res.resize(box);
    for (int i = 0; i < box; i++) {
        res[i] = min(c[i], cum[i]);
    }

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