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

/*
dp[i][j][k]表示當前處理第i棵樹，第i棵樹是第j種顏色的代價
如果當前值非0,不用處理花費dp[i][c[i][k]=min(dp[i][c[i][k],dp[i-1][j][k-1])
如果當前值是0,要處理花費dp[i][now][k]=min(dp[i][now][k],dp[i-1][last][k]+p[i][now]),
dp[i][now][k]=min(dp[i][now][k],dp[i-1][last][k-1]+p[i][now])
*/
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
#define LL long long
LL inf=1e18;
int n,m,K;
LL co[105];
LL dp[105][105][105];
LL p[105][105];

int main()
{
    LL i,j,k,c;
    cin>>n>>m>>K;
    for(i=1;i<=n;i++)
        cin>>co[i];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            scanf("%d",&p[i][j]);
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            for(k=0;k<=n;k++)
                dp[i][j][k]=inf;
    for(i=1;i<=n;i++)
    {
        for(k=1;k<=i;k++)
        {
            if(co[i])
            {
                dp[i][co[i]][k]=dp[i-1][co[i]][k];
                for(j=1;j<=m;j++)
                    if(co[i]!=j)
                        dp[i][co[i]][k]=min(dp[i][co[i]][k],dp[i-1][j][k-1]);
            }
            else
            {
                for(j=1;j<=m;j++)
                    for(c=1;c<=m;c++)
                        if(j==c) dp[i][c][k]=min(dp[i][c][k],dp[i-1][j][k]+p[i][c]);
                        else dp[i][c][k]=min(dp[i][c][k],dp[i-1][j][k-1]+p[i][c]);
            }
        }
    }

    LL ans=inf;
    for(i=1;i<=m;i++)
        ans=min(ans,dp[n][i][K]);
    if(ans>=inf)
        ans=-1;
    cout<<ans;
}