Submission #456273

#TimeUsernameProblemLanguageResultExecution timeMemory
456273armandDistributing Candies (IOI21_candies)C++17
3 / 100
5080 ms13344 KiB
#include "candies.h"

#include <vector>
#include <algorithm>

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
	int i, j;
    int n = c.size();
    std::vector<int> s(n);
	int m = v.size();
	for (i = 0; i < m; i++) {
		if (v[i] > 0)
			for (j = l[i]; j <= r[i]; j++)
				s[j] = std::min(c[j], s[j] + v[i]);
		else
			for (j = l[i]; j <= r[i]; j++)
				s[j] = s[j] + v[i] < 0 ? 0 : s[j] + v[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...