Codeforces Round #369 (Div. 2)C. Coloring Trees

ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from 1 to n from left to right.

Initially, tree i has color ci. ZS the Coder and Chris the Baboon recognizes only m different colors, so 0 ≤ ci ≤ m, where ci = 0 means that tree i is uncolored.

ZS the Coder and Chris the Baboon decides to color only the uncolored trees, i.e. the trees with ci = 0. They can color each of them them in any of the m colors from 1 to m. Coloring the i-th tree with color j requires exactly pi, j litres of paint.

The two friends define the beauty of a coloring of the trees as the minimum number of contiguous groups (each group contains some subsegment of trees) you can split all the n trees into so that each group contains trees of the same color. For example, if the colors of the trees from left to right are 2, 1, 1, 1, 3, 2, 2, 3, 1, 3, the beauty of the coloring is 7, since we can partition the trees into 7 contiguous groups of the same color : {2}, {1, 1, 1}, {3}, {2, 2}, {3}, {1}, {3}.

ZS the Coder and Chris the Baboon wants to color all uncolored trees so that the beauty of the coloring is exactly k. They need your help to determine the minimum amount of paint (in litres) needed to finish the job.

Please note that the friends can’t color the trees that are already colored.
Input

The first line contains three integers, n, m and k (1 ≤ k ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of trees, number of colors and beauty of the resulting coloring respectively.

The second line contains n integers c1, c2, …, cn (0 ≤ ci ≤ m), the initial colors of the trees. ci equals to 0 if the tree number i is uncolored, otherwise the i-th tree has color ci.

Then n lines follow. Each of them contains m integers. The j-th number on the i-th of them line denotes pi, j (1 ≤ pi, j ≤ 109) — the amount of litres the friends need to color i-th tree with color j. pi, j’s are specified even for the initially colored trees, but such trees still can’t be colored.
Output

Print a single integer, the minimum amount of paint needed to color the trees. If there are no valid tree colorings of beauty k, print  - 1.
Examples
Input

3 2 2
0 0 0
1 2
3 4
5 6

Output

10

Input

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

Output

-1

Input

3 2 2
2 0 0
1 3
2 4
3 5

Output

5

Input

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

Output

0

【题意】给你n个树，需要给这些树染色，假如标号不为0的树说明已经染色了，最后给一个k，要求染色后的树连续色段等于k，不同的树染不同的颜色花费也不同，求能够完成要求的最小花费是多少，假如不能完成，则输出-1；

【解题思路】显然是一个dp，可以直接使用三维dp，不会超时；但要注意dp值的初始化以及状态的变换；

【AC代码】

#include<bits/stdc++.h>
#define ll __int64
#define maxn 105
#define fff 1e17
using namespace std;
ll col[maxn][maxn],dp[maxn][maxn][maxn];
int a[maxn];   //此处不能用ll,会用其与int型值进行比较
int main()
{
    int n,m,k,i,j,l,t,vis=0;
    scanf("%d%d%d",&n,&m,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(a[i])
            vis++;  //记录已经染色的树的个数
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            scanf("%I64d",&col[i][j]);
    if(vis==n)  //若全都染好了色，直接判断
    {
        int sum=0;
        for(i=1;i<=n;i++)
            if(a[i]!=a[i-1])
                sum++;
        if(sum==k)
            printf("0\n");
        else
            printf("-1\n");
        return 0;
    }
    for(i=0;i<=n;i++)
        for(j=0;j<=n;j++)
            for(l=0;l<=m;l++)
                dp[i][j][l]=fff;  //注意初始化
    for(i=1;i<=m;i++)
        dp[0][1][i]=0;  //注意初始化
    for(i=1;i<=n;i++)  
    {
    //分为已染色和未染色
        if(a[i])
            for(j=1;j<=i;j++)
                for(l=1;l<=m;l++)
                {
                    if(l==a[i])
                        dp[i][j][l]=min(dp[i][j][l],dp[i-1][j][l]);  //已染色的树不用再算花费
                    else
                        dp[i][j][a[i]]=min(dp[i][j][a[i]],dp[i-1][j-1][l]);
                }
        else
            for(j=1;j<=i;j++)  //表示最多有j个颜色段
                for(l=1;l<=m;l++)  //当前的树染色的情况
                    for(t=1;t<=m;t++)  //拿上一个树的所有情况与现在的树比较
                    {
                        if(l==t)
                            dp[i][j][l]=min(dp[i][j][l],dp[i-1][j][l]+col[i][l]);
                        else
                            dp[i][j][l]=min(dp[i][j][l],dp[i-1][j-1][t]+col[i][l]);
                    }
    }
    ll ans=fff;
    for(i=1;i<=m;i++)
        ans=min(ans,dp[n][k][i]);
    if(ans==fff)
        printf("-1\n");
    else
        printf("%I64d\n",ans);
    return 0;
}