oj.uz

Submission #401643

# Submission time Handle Problem Language Result Execution time Memory
401643 2021-05-10T15:44:52 Z BERNARB01 Fireworks (APIO16_fireworks) C++17
19 / 100
 103 ms 12272 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;
	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.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 12236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12204 KB Output is correct
2 Correct 10 ms 12252 KB Output is correct
3 Correct 13 ms 12212 KB Output is correct
4 Correct 37 ms 12216 KB Output is correct
5 Correct 24 ms 12252 KB Output is correct
6 Correct 26 ms 12260 KB Output is correct
7 Correct 28 ms 12128 KB Output is correct
8 Correct 32 ms 12236 KB Output is correct
9 Correct 36 ms 12236 KB Output is correct
10 Correct 41 ms 12236 KB Output is correct
11 Correct 42 ms 12236 KB Output is correct
12 Correct 45 ms 12236 KB Output is correct
13 Correct 51 ms 12240 KB Output is correct
14 Correct 103 ms 12272 KB Output is correct
15 Correct 52 ms 12236 KB Output is correct
16 Correct 50 ms 12204 KB Output is correct
17 Correct 54 ms 12240 KB Output is correct
18 Correct 54 ms 12236 KB Output is correct
19 Correct 46 ms 12236 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 12236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 12236 KB Output isn't correct
2 Halted 0 ms 0 KB -