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

原创 2016年08月31日 10:40:23

原题链接

C. Coloring Trees
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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, nm and k (1 ≤ k ≤ n ≤ 1001 ≤ 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 jpi, 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
Note

In the first sample case, coloring the trees with colors 2, 1, 1 minimizes the amount of paint used, which equals to 2 + 3 + 5 = 10. Note that 1, 1, 1 would not be valid because the beauty of such coloring equals to 1 ({1, 1, 1} is a way to group the trees into a single group of the same color).

In the second sample case, all the trees are colored, but the beauty of the coloring is 3, so there is no valid coloring, and the answer is - 1.

In the last sample case, all the trees are colored and the beauty of the coloring matches k, so no paint is used and the answer is 0.



设dp[i][j][k]表示把第i棵树染成第j种颜色且前i棵树的beauty为k时的最小代价.

1.若第i棵树已经被染色: dp[i][j][h] = min(dp[i][j][h], dp[i-1][j][h])  dp[i][j][h] = min(dp[i][j][h], dp[i-1][p][h-1])(p != j)

2.若第i棵树未被染色: dp[i][j][h] = min(dp[i][j][h], dp[i-1][j][h] + cost[i][j])  dp[i][j][h] = min(dp[i][j][h], dp[i-1][p][h-1] + cost[i][j])(p != j)

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#define maxn 110
#define INF 1e15 
typedef long long ll;
using namespace std;

ll dp[maxn][maxn][maxn], cost[maxn][maxn];
int num[maxn];
int main(){
	
//	freopen("in.txt", "r", stdin);
	int n, m, k;
	
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; i++)
	 scanf("%d", num+i);
	 
	for(int i = 1; i <= n; i++)
	 for(int j = 1; j <= m; j++)
	  scanf("%I64d", &cost[i][j]);
	  
	for(int i = 1; i <= n; i++)
	 for(int j = 0; j <= m; j++)
	  for(int h = 0; h <= k; h++)
	   dp[i][j][h] = INF;
	if(num[1])
	 dp[1][num[1]][1] = 0;
	else{
		for(int h = 1; h <= m; h++)
		 dp[1][h][1] = cost[1][h];
	}
	
	for(int i = 2; i <= n; i++){
		if(num[i]){
			for(int h = 1; h <= k; h++){
				dp[i][num[i]][h] = min(dp[i][num[i]][h], dp[i-1][num[i]][h]);
				for(int p = 1; p <= m; p++){
					if(p != num[i]) 
					dp[i][num[i]][h] = min(dp[i][num[i]][h], dp[i-1][p][h-1]);
				}
			}
		}
		else{
			for(int j = 1; j <= m; j++)
			 for(int h = 1; h <= k; h++){
			 	dp[i][j][h] = min(dp[i][j][h], dp[i-1][j][h] + cost[i][j]);
			 	for(int p = 1; p <= m; p++){
			 		if(p != j)
			 		 dp[i][j][h] = min(dp[i][j][h], dp[i-1][p][h-1] + cost[i][j]);
				 }
			 }
		}
	}
	ll ans = dp[n][1][k];
	for(int i = 2; i <= m; i++)
	 ans = min(ans, dp[n][i][k]);
	if(ans == INF)
	 ans = -1;
	printf("%I64d\n", ans);
	
	return 0; 
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

Codeforces Round #406 (Div. 2):C. Berzerk(记忆化搜索解决博弈问题)

C. Berzerk time limit per test 4 seconds memory limit per test 256 megabytes input standard in...
  • Jaihk662
  • Jaihk662
  • 2017年03月24日 15:23
  • 783

【Codeforces Round 375 (Div 2) E】【欧拉回路Fleury算法 或网络流】One-Way Reform 每条边定向使得最多的点满足入度=出度

E. One-Way Reform time limit per test 2 seconds memory limit per test 256 megabytes ...
  • snowy_smile
  • snowy_smile
  • 2016年10月04日 10:20
  • 733

Codeforces 432C Prime Swaps【筛法素数预处理+贪心】

C. Prime Swaps time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu...
  • mengxiang000000
  • mengxiang000000
  • 2016年10月11日 21:40
  • 417

Codeforces Round #347 (Div. 2) D. Graph Coloring(最少需要选择多少个点,使得所有边的颜色相同)

D. Graph Coloring time limit per test 1 second memory limit per test 256 megabytes ...
  • acm_fighting
  • acm_fighting
  • 2016年04月26日 20:17
  • 347

codeforces 776C Molly's Chemicals(连续子序列和为k的次方的个数)

C. Molly's Chemicals time limit per test 2.5 seconds memory limit per test 512 megabytes input...
  • zwj1452267376
  • zwj1452267376
  • 2017年02月24日 02:47
  • 870

Codeforces Round #408 (Div. 2)-C. Bank Hacking-(三种方法)分类讨论,二分,集合

补题速度太慢了,这样可不行啊。 代码里都有解释。 看别人代码有三种写法 set,分类,和二分。 这是个是用分类思想写的,#include using namespace std; /* 一开...
  • qq_35781950
  • qq_35781950
  • 2017年04月19日 20:52
  • 136

数学推公式——较难——Codeforces Round #187 (Div. 2)

题目链接: http://codeforces.com/contest/315/problem/C C. Sereja and Contest time limi...
  • CS_liuqing
  • CS_liuqing
  • 2013年06月16日 15:34
  • 1994

Codeforces Round #244 (Div. 2)(强连通分量,后缀数组)

A. Police Recruits #include #include #include #include using namespace std; int n; int main() { ...
  • u010660276
  • u010660276
  • 2014年05月23日 20:08
  • 419

Codeforces Round #248 (Div. 2) B题 【数据结构:树状数组】

题目链接:http://codeforces.com/contest/433/problem/B 题目大意:给n(1 ≤ n ≤ 105)个数据(1 ≤ vi ≤ 109),其中有m(1 ≤ m ≤...
  • u013912596
  • u013912596
  • 2014年05月24日 18:18
  • 706

Codeforces Round #312 (Div. 2) (第三题是位运算,好题)

比赛:点击打开链接 558A - Lala Land and Apple Trees 分析:从0坐标分开,负半轴一个数组,正半轴一个数组,来记录果树的左边和数量,可以用结构体数组来存储数据,其...
  • loveyou11111111
  • loveyou11111111
  • 2015年08月31日 16:30
  • 156
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #369 (Div. 2)-C. Coloring Trees
举报原因:
原因补充:

(最多只允许输入30个字)