Codeforces 580D Kefa and Dishes(dp+状态压缩)



Codeforces 580D Kefa and Dishes

Kefa and Dishes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a_i 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 a_i, (0 ≤ a_i ≤ 10⁹) — 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 x_i, y_i and c_i (1 ≤ x_i, y_i ≤ n, 0 ≤ c_i ≤ 10⁹). That means that if you eat dish x_i right before dish y_i, then the Kefa's satisfaction increases by c_i. It is guaranteed that there are no such pairs of indexes i and j (1 ≤ i < j ≤ k), that x_i = x_j and y_i = y_j.

Output

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

Examples

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

Note

In the first sample it is best to first eat the second dish, then the first one. Then we get one unit of satisfaction for each dish and plus one more for the rule.

In the second test the fitting sequences of choice are 4 2 1 or 2 1 4. In both cases we get satisfaction 7 for dishes and also, if we fulfill rule 1, we get an additional satisfaction 5.

题意：

有n盘菜，每盘菜有一个满意值，要从这n盘菜中选出m盘菜吃，使获得的满意值最大，同时，题目给出k条规则，如果按特定规则的顺序吃菜，能获得额外的满意值，问能获得的最大满意值。

分析：

因为只有18盘菜，可以用18位2进制数i来表示状态。dp[i][j]，i表示状态，如果选中了第x盘菜，则i的第x位为1，j表示最后吃的是第j盘菜。每种状态都能由之前的状态转移得到，例如010001可以由010000、000001转移得到，记录当前状态下最后吃第j盘菜时的最优解。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int cmp(const void* a,const void* b){
	return (*(int*)a)-(*(int*)b);
}
long long d[1<<20][20],max=0;
int main(){
	long long n,m,k,num[20],rule[20][20],a,b,c,dish,f=0;
	scanf("%I64d%I64d%I64d",&n,&m,&k);
	memset(rule,0,sizeof(rule));
	memset(d,0,sizeof(d));
	dish=1<<n;
	for(int i=0;i<n;i++){
		scanf("%I64d",&num[i]);
		d[1<<i][i]=num[i];
	}
	for(int i=0;i<k;i++){
		scanf("%I64d%I64d%I64d",&a,&b,&c);
		rule[a-1][b-1]=c;
	}
	for(int i=0;i<dish;i++){
		f=0;
		for(int j=0;j<n;j++){
			if((i&(1<<j))!=0){
				//printf("   %d\n",i&(1<<j));
				f++;
				for(int t=0;t<n;t++){
					if((i&(1<<t))==0){
						if(d[i+(1<<t)][t]<(d[i][j]+num[t]+rule[j][t]))d[i+(1<<t)][t]=d[i][j]+num[t]+rule[j][t];
					}
				}
			}
		}
		if(f==m){
			for(int j=0;j<n;j++){
				if((i&(1<<j))!=0&&max<d[i][j])max=d[i][j];
			}
		}
	}
	printf("%I64d\n",max);
	return 0;
}