codeforces 580 D. Kefa and Dishes (状压dp)

最新推荐文章于 2021-04-13 21:27:04 发布

原创最新推荐文章于 2021-04-13 21:27:04 发布 · 1k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm #dp

动态规划专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一道编程题目“Kefa与菜肴”的解决方案，通过状态压缩动态规划（DP）来帮助角色Kefa从有限种类的菜肴中选择最佳组合，以最大化其满意度。文章详细解释了算法步骤，包括初始化DP数组、迭代更新状态以考虑所有可能的菜肴组合，并最终确定最大满意度。

When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There were n dishes. Kefa knows that he needs exactly m dishes. But at that, he doesn't want to order the same dish twice to taste as many dishes as possible.

Kefa knows that the i-th dish gives him ai units of satisfaction. But some dishes do not go well together and some dishes go very well together. Kefa set to himself k rules of eating food of the following type — if he eats dish x exactly before dish y (there should be no other dishes between x and y), then his satisfaction level raises by c.

Of course, our parrot wants to get some maximal possible satisfaction from going to the restaurant. Help him in this hard task!

Input

The first line of the input contains three space-separated numbers, n, m and k (1 ≤ m ≤ n ≤ 18, 0 ≤ k ≤ n * (n - 1)) — the number of dishes on the menu, the number of portions Kefa needs to eat to get full and the number of eating rules.

The second line contains n space-separated numbers ai, (0 ≤ ai ≤ 109) — the satisfaction he gets from the i-th dish.

Next k lines contain the rules. The i-th rule is described by the three numbers xi, yi and ci (1 ≤ xi, yi ≤ n, 0 ≤ ci ≤ 109). That means that if you eat dish xi right before dish yi, then the Kefa's satisfaction increases by ci. It is guaranteed that there are no such pairs of indexes iand j (1 ≤ i < j ≤ k), that xi = xj and yi = yj.

Output

In the single line of the output print the maximum satisfaction that Kefa can get from going to the restaurant.

Sample test(s)

input
2 2 1
1 1
2 1 1

output
3

input
4 3 2
1 2 3 4
2 1 5
3 4 2

output
12

裸状压dp

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define LL __int64

const int N = 20;

LL a[N];
LL G[N][N];
LL dp[1 << N][N];
LL num[1 << N];

void gao(int n, int m, int k) {
	memset(dp, -1, sizeof(dp));
	LL ans = 0;
	for(int i = 0; i < n; ++i) {
		dp[1 << i][i] = a[i];
		num[1 << i] = 1;
		if(m == 1) {
			ans = max(ans, a[i]);
		}
	}
	
	int maxx = (1 << n);
	for(int i = 0; i < maxx; ++i) {
		for(int j = 0; j < n; ++j) {
			if(dp[i][j] == -1) continue;
			for(int k = 0; k < n; ++k) {
				if(i & (1 << k)) continue;
				dp[i | (1 << k)][k] = max(dp[i | (1 << k)][k], dp[i][j] + a[k] + G[j][k]);
				num[i | (1 << k)] = num[i] + 1;
				if(num[i | (1 << k)] == m) {
					ans = max(ans, dp[i | (1 << k)][k]);
				}
			}
		}
	}
	cout<<ans<<endl;
}

int main() {
	int n, m, k;
	cin>>n>>m>>k;
	for(int i = 0; i < n; ++i) {
		cin>>a[i];
	}
	for(int i = 0; i < k; ++i) {
		int u, v;
		LL c;
		cin>>u>>v>>c;
		--u; --v;
		G[u][v] = c;
	}
	gao(n, m, k);
	return 0;
}