Submission #472733

#TimeUsernameProblemLanguageResultExecution timeMemory
472733oliversommerDistributing Candies (IOI21_candies)C++17
0 / 100
129 ms7340 KiB
#include "candies.h"

#include <algorithm>
#include <vector>

using namespace std;

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

	for (int j = 0; j < q; ++j) {
		int left = l[j];
		int right = r[j];
		s[left] += v[j];
		s[right] -= v[j];
	}

	for(int i = 1; i < n; ++i) {
		s[i] += s[i - 1];
		s[i - 1] = min(s[i - 1], c[i - 1]);
	}
	s[0] = min(s[0], c[0]);

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