Submission #472684

#	Time	Username	Problem	Language	Result	Execution time	Memory
472684		oliversommer	Distributing Candies (IOI21_candies)	C++17	0 / 100	120 ms	7336 KiB

candies

#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) {
		s[l[j]] = min(s[l[j]] + v[j], c[j]);
		s[r[j]] = max(s[r[j]] - v[j], 0);
	}

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

	return s;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33