Codeforces 580D Kefa and Dishes【状压dp】

最新推荐文章于 2022-08-16 21:52:06 发布

mengxiang000000

最新推荐文章于 2022-08-16 21:52:06 发布

阅读量459

点赞数

分类专栏： dp 文章标签： Codeforces 580D

本文链接：https://blog.csdn.net/mengxiang000000/article/details/52958508

版权

dp 专栏收录该内容

351 篇文章 2 订阅

订阅专栏

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

Input

Output

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个食物，对应只能吃M个食物，有K个相对关系。

吃了对应的食物都会有对应的满意值，对应K个关系：

xi，yi，ci表示吃完xi马上吃yi能够额外获得ci的满意值。

问怎样吃能够获得最大满意值。

思路：

1、观察到NM都是18以内的数据，那么考虑状压dp：

①设定dp【i】【j】表示对应已经吃了状态J的食物，并且吃的最后一个食物的编号是i的最大满意值。假设j==5,5=101，其表示吃了第一个和第三个食物，没有吃第二个食物。

②那么我们不难推出其状态转移方程：

dp【i】【j】=max(dp【i】【j】，dp【k】【q】+a【i】+map【k】【i】)；

这里j是当前状态，q是上一状态，那么q==j-（1<<i）；表示吃完了k这个食物之后，然后紧接着吃食物i的状态转移。

其中map【k】【i】表示吃完k马上吃i能够获得的额外的满意值。

2、注意数组的初始化即可（好水的一个D）。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define ll __int64
ll dp[18][(1<<18)+15];
ll a[20];
ll map[20][20];
int main()
{
    int n,m,k;
    while(~scanf("%d%d%d",&n,&m,&k))
    {
        memset(dp,0,sizeof(dp));
        memset(map,0,sizeof(map));
        for(int i=0;i<n;i++)
        {
            scanf("%I64d",&a[i]);
        }
        while(k--)
        {
            int x,y,w;
            scanf("%d%d%d",&x,&y,&w);
            x--;y--;
            map[x][y]=w;
        }
        ll output=0;
        for(int j=0;j<(1<<n);j++)
        {
            int cont=0;
            ll tmp=j;
            while(tmp)
            {
                if(tmp%2==1)cont++;
                tmp/=2;
            }
            for(int i=0;i<n;i++)
            {
                if((j&(1<<i))!=0)
                {
                    for(int k=0;k<n;k++)
                    {
                        if((j&(1<<k))!=0)
                        {
                            int q=j-(1<<i);
                            dp[i][j]=max(dp[i][j],dp[k][q]+a[i]+map[k][i]);
                        }
                    }
                }
                if(cont==m)output=max(output,dp[i][j]);
            }
        }
        printf("%I64d\n",output);
    }
}