Codeforces Round #369 (Div. 2) C. Coloring Trees
来源:互联网 发布:最红网络歌曲36首 编辑:程序博客网 时间:2024/05/20 21:44
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park wheren trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from1 to n from left to right.
Initially, tree i has color ci. ZS the Coder and Chris the Baboon recognizes onlym different colors, so 0 ≤ ci ≤ m, whereci = 0 means that treei is uncolored.
ZS the Coder and Chris the Baboon decides to color only the uncolored trees, i.e. the trees withci = 0. They can color each of them them in any of them colors from 1 tom. Coloring the i-th tree with colorj requires exactly pi, j litres of paint.
The two friends define the beauty of a coloring of the trees as theminimum number of contiguous groups (each group contains some subsegment of trees) you can split all then trees into so that each group contains trees of the same color. For example, if the colors of the trees from left to right are2, 1, 1, 1, 3, 2, 2, 3, 1, 3, the beauty of the coloring is7, 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 isexactly 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.
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 to0 if the tree number i is uncolored, otherwise thei-th tree has color ci.
Then n lines follow. Each of them containsm integers. The j-th number on thei-th of them line denotes pi, j (1 ≤ pi, j ≤ 109) — the amount of litres the friends need to colori-th tree with color j. pi, j's are specified even for the initially colored trees, but such trees still can't be colored.
Print a single integer, the minimum amount of paint needed to color the trees. If there are no valid tree colorings of beautyk, print - 1.
3 2 20 0 01 23 45 6
10
3 2 22 1 21 32 43 5
-1
3 2 22 0 01 32 43 5
5
3 2 32 1 21 32 43 5
0
代码:
#include <bits/stdc++.h>using namespace std;const int N=100005;typedef long long ll;int num[105],cost[105][105];ll dp[105][105][105];int main(){ 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("%d",&cost[i][j]); } } for(int i=1;i<=n;i++) for(int k=0;k<=K;k++) { for(int j=0;j<=m;j++) { dp[i][k][j]=1e15; } } for(int k=1;k<=K;k++) { for(int j=1;j<=m;j++) { dp[0][k][j]=1e15; } } for(int i=1;i<=n;i++) { if(num[i]==0) for(int k=1;k<=K;k++) { for(int j=1;j<=m;j++) { dp[i][k][j]=min(dp[i][k][j],dp[i-1][k][j]+cost[i][j]); for(int q=1;q<=m;q++) { if(q==j&&i!=1) continue; dp[i][k][j]=min(dp[i][k][j],dp[i-1][k-1][q]+cost[i][j]); } // cout<<dp[i][k][j]<<endl; } } else { for(int k=1;k<=K;k++) { for(int j=1;j<=m;j++) { if(j==num[i]&&i!=1) { dp[i][k][num[i]]=min(dp[i][k][num[i]],dp[i-1][k][j]); } else { dp[i][k][num[i]]=min(dp[i][k][num[i]],dp[i-1][k-1][j]); }//cout<<dp[i][k][j]<<endl; } } } } long long ans=1e15; for(int i=1;i<=m;i++) {ans=min(ans,dp[n][K][i]);} if(ans==1e15) {puts("-1");} else {cout<<ans<<endl;} return 0;}
- 【Codeforces Round #369 (Div. 2)】Codeforces 711C Coloring Trees
- Codeforces Round #369 (Div. 2) [C] Coloring Trees
- Codeforces Round #369 (Div. 2) C. Coloring Trees
- Codeforces Round #369 (Div. 2) C. Coloring Trees
- [Codeforces Round #369 (Div. 2) C. Coloring Trees] DP
- Codeforces Round #369 (Div. 2) C.Coloring Trees (基础DP)
- codeforces Round #369 (Div. 2) C. Coloring Trees (三维DP)
- Codeforces Round #369 (Div. 2)-C. Coloring Trees
- Codeforces Round #369 (Div. 2) [C] Coloring Trees
- Codeforces Round #369 (Div. 2)C. Coloring Trees
- Codeforces Round #369 (Div. 2)C. Coloring Trees
- Codeforces Round #369 (Div. 2) C. Coloring Trees 三维dp
- Codeforces Round #369 (Div. 2) C. Coloring Trees 动态规划
- DP方程——Coloring Trees ( Codeforces Round #369 (Div. 2) C )
- Codeforces Round #369 (Div. 2) -- C. Coloring Trees (三维DP)
- Codeforces Round #369 (Div. 2) C. Coloring Trees 数位dp,好题
- Codeforces Round #369 (Div. 2) C. Coloring Trees —— DP
- codeforces round 369div2 C Coloring Trees
- 高并发网站架构与正态分布的前生今世
- JavaScript实现拖拽预览,AJAX小文件上传
- JS计时器,setTimeout与setInterval
- php 的each()输出内容空白问题
- REST:Atom的开源框架Apache Abdera
- Codeforces Round #369 (Div. 2) C. Coloring Trees
- 获取定位授权和注意事项
- 旋转特效-鼠标经过
- easy UI简单使用介绍
- Unity3D深入浅出 - 动画系统(Mecanim)
- HashMap的实现原理
- Android官方培训课程学习(一): 兼容不同设备
- PhpExcel中文帮助手册|PhpExcel使用方法
- jquery $.proxy使用