Codeforces Round 321 (Div. 2)
D
Kefa and Dishes
Codeforces
1800
原题
← CE →
翻译中…

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^{9}$) — 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^{9}$). 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.

翻译中…

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.

翻译中…

样例

Input #1
2 2 1
1 1
2 1 1
Output #1
3
InputCopy OutputCopy
Input #2
4 3 2
1 2 3 4
2 1 5
3 4 2
Output #2
12
InputCopy OutputCopy
题目信息
题号
580D
时间限制
2 s
内存限制
256 MB
标签
位运算
动态规划

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。