Submission #401644

#	Time	Username	Problem	Language	Result	Execution time	Memory
401644		BERNARB01	Fireworks (APIO16_fireworks)	C++17	19 / 100	103 ms	12260 KiB

fireworks

#include <bits/stdc++.h>

using namespace std;

const int N = 5001;
const long long inf = (long long) 4e18L;

int n, m;
vector<pair<int, long long>> g[N];
long long dp[N][302];

long long sol(int u, int left) {
	if (g[u].size() == 0) {
		assert(left == 0);
		return 0;
	}
	long long& ret = dp[u][left];
	if (ret != -1) {
		return ret;
	}
	ret = 0;
	for (pair<int, long long> _p : g[u]) {
		long long sub = inf;
		int v = _p.first;
		long long w = _p.second;
		if (g[v].size() == 0) {
			sub = abs(w - left);
			ret += sub;
			continue;
		}
		for (int j = 0; j <= left; j++) {
			sub = min(sub, abs(w - j) + sol(v, left - j));
		}
		ret += sub;
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	if (n == 1) {
		vector<long long> cs;
		for (int i = 1; i < n + m; i++) {
			int p;
			long long c;
			cin >> p >> c;
			cs.emplace_back(c);
		}
		sort(cs.begin(), cs.end());
		long long loc = cs[cs.size() / 2];
		long long ans = 0;
		for (int i = 0; i < n; i++) {
			ans += abs(loc - cs[i]);
		}
		cout << ans << '\n';
		return 0;
	}
	long long res = 0;
	for (int i = 1; i < n + m; i++) {
		int p;
		long long c;
		cin >> p >> c;
		g[p - 1].emplace_back(i, c);
		res += c;
	}
	memset(dp, -1, sizeof dp);
	for (int i = 0; i < 301; i++) {
		res = min(res, sol(0, i));
	}
	cout << res << '\n';
	return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 19 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45