Submission #574391

#	Time	Username	Problem	Language	Result	Execution time	Memory
574391		wjajjsasqq	Distributing Candies (IOI21_candies)	C++17	27 / 100	4963 ms	8156 KiB

candies

#include "candies.h"
#include <algorithm>
#include <cstdio>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

const int INF = 1070000000;

const int N = 200008;
int n, a[N], c[N], C, res[N];
long long inc[N];

std::vector<int> distribute_candies(std::vector<int> c_, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
	n = (int)c_.size();
	std::vector<int> ans(n);
	C = c_[0];
	for (int i = 0; i < (int)l.size(); ++i) {
		int ll = l[i], rr = r[i] + 1, d = v[i];
		for (int j = ll; j < rr; ++j) res[j] += d;
		if (d < 0) {
			for (int j = ll; j < rr; ++j) res[j] = res[j] < 0 ? 0 : res[j];
		}
		else {
			for (int j = ll; j < rr; ++j) res[j] = res[j] < C ? res[j] : C;
		}
	}
	for (int j = 0; j < n; ++j) ans[j] = res[j];
	return ans;
}

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