oj.uz

Submission #401647

# Submission time Handle Problem Language Result Execution time Memory
401647 2021-05-10T15:49:43 Z BERNARB01 Fireworks (APIO16_fireworks) C++17
26 / 100
 109 ms 12252 KB 
#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 < (int) cs.size(); 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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 432 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12248 KB Output is correct
2 Correct 12 ms 12236 KB Output is correct
3 Correct 13 ms 12252 KB Output is correct
4 Correct 38 ms 12236 KB Output is correct
5 Correct 25 ms 12252 KB Output is correct
6 Correct 27 ms 12176 KB Output is correct
7 Correct 29 ms 12160 KB Output is correct
8 Correct 32 ms 12236 KB Output is correct
9 Correct 36 ms 12232 KB Output is correct
10 Correct 41 ms 12236 KB Output is correct
11 Correct 43 ms 12232 KB Output is correct
12 Correct 46 ms 12236 KB Output is correct
13 Correct 51 ms 12236 KB Output is correct
14 Correct 104 ms 12236 KB Output is correct
15 Correct 53 ms 12236 KB Output is correct
16 Correct 50 ms 12236 KB Output is correct
17 Correct 51 ms 12236 KB Output is correct
18 Correct 54 ms 12240 KB Output is correct
19 Correct 47 ms 12236 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 8 ms 12248 KB Output is correct
12 Correct 12 ms 12236 KB Output is correct
13 Correct 13 ms 12252 KB Output is correct
14 Correct 38 ms 12236 KB Output is correct
15 Correct 25 ms 12252 KB Output is correct
16 Correct 27 ms 12176 KB Output is correct
17 Correct 29 ms 12160 KB Output is correct
18 Correct 32 ms 12236 KB Output is correct
19 Correct 36 ms 12232 KB Output is correct
20 Correct 41 ms 12236 KB Output is correct
21 Correct 43 ms 12232 KB Output is correct
22 Correct 46 ms 12236 KB Output is correct
23 Correct 51 ms 12236 KB Output is correct
24 Correct 104 ms 12236 KB Output is correct
25 Correct 53 ms 12236 KB Output is correct
26 Correct 50 ms 12236 KB Output is correct
27 Correct 51 ms 12236 KB Output is correct
28 Correct 54 ms 12240 KB Output is correct
29 Correct 47 ms 12236 KB Output is correct
30 Incorrect 109 ms 12252 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 8 ms 12248 KB Output is correct
12 Correct 12 ms 12236 KB Output is correct
13 Correct 13 ms 12252 KB Output is correct
14 Correct 38 ms 12236 KB Output is correct
15 Correct 25 ms 12252 KB Output is correct
16 Correct 27 ms 12176 KB Output is correct
17 Correct 29 ms 12160 KB Output is correct
18 Correct 32 ms 12236 KB Output is correct
19 Correct 36 ms 12232 KB Output is correct
20 Correct 41 ms 12236 KB Output is correct
21 Correct 43 ms 12232 KB Output is correct
22 Correct 46 ms 12236 KB Output is correct
23 Correct 51 ms 12236 KB Output is correct
24 Correct 104 ms 12236 KB Output is correct
25 Correct 53 ms 12236 KB Output is correct
26 Correct 50 ms 12236 KB Output is correct
27 Correct 51 ms 12236 KB Output is correct
28 Correct 54 ms 12240 KB Output is correct
29 Correct 47 ms 12236 KB Output is correct
30 Incorrect 109 ms 12252 KB Output isn't correct
31 Halted 0 ms 0 KB -