Codeforces Round #369 (Div. 2) C. Coloring Trees 数位dp,好题
来源:互联网 发布:知无知 谌洪果简历 编辑:程序博客网 时间:2024/05/17 06:37
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 7contiguous 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.
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.
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.
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
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.
Source
Codeforces Round #369 (Div. 2)
My Solution
数位dp, 好题
状态定义 dp i j k 为 当前在 从左往右 第 i 位, 且 以 j 结尾, 已经有 k 个片段
初始化 dp[ i ][ j ][ k ] = INF
边界 if(i == 1) ......
状态转移方程 if(val[ i ] == 0) dp[ i ][ j ][ k ] = min(dp[ i ][ j ][ k ], dp[ i - 1 ][ x ][ k - 1] + p[ i ][ j ]); // x = 1 ~ m, x != j
else dp[ i ][ j ][ k ] = min(dp[ i ][ j ][ k ], dp[ i - 1][ x ][ k - 1]); // x = 1 ~ m, x != j
复杂度 O(n^4)
#include <iostream>#include <cstdio>#include <cstring>using namespace std;typedef long long LL;const int maxn = 1e2 + 8;LL col[maxn], p[maxn][maxn], dp[maxn][maxn][maxn];int main(){ #ifdef LOCAL freopen("c.txt", "r", stdin); //freopen("o.txt", "w", stdout); int T = 4; while(T--){ #endif // LOCAL ios::sync_with_stdio(false); cin.tie(0); LL n, m, kk; cin >> n >> m >> kk; for(int i = 1; i <= n; i++){ cin >> col[i]; } for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ cin >> p[i][j]; } } for(int i = 0; i <= n + 1; i++){ for(int j = 0; j <= m + 1; j++){ for(int k = 0; k <= kk + 1; k++){ dp[i][j][k] = 9e18; } } } //cout<<dp[0][0][0]<<endl; int i, j, k, y; for(i = 1; i <= n; i++){ for(k = 1; k <= kk; k++){ if(k > i) break; if(col[i] != 0){ if(i == 1){ dp[i][col[i]][1] = 0; continue; } j = col[i]; dp[i][j][k] = dp[i-1][j][k]; for(y = 1; y <= m; y++){ if(j == y) continue; else dp[i][j][k] = min(dp[i][j][k], dp[i - 1][y][k - 1]); } } else{ if(i == 1){ for(y = 1; y <= m; y++){ dp[i][y][1] = p[1][y]; } continue; } for(j = 1; j <= m; j++){ dp[i][j][k] = dp[i - 1][j][k] + p[i][j]; for(y = 1; y <= m; y++){ if(j == y) continue; else dp[i][j][k] = min(dp[i][j][k], dp[i - 1][y][k - 1] + p[i][j]); } } } } } LL ans = 9e18; for(j = 1; j <= m; j++){ ans = min(ans, dp[n][j][kk]); } if(ans == 9e18) cout << -1 << endl; else cout << ans << endl; #ifdef LOCAL cout << endl; } #endif // LOCAL return 0;}
Thank you!
------from ProLights
- 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 (三维DP)
- Codeforces Round #369 (Div. 2) C. Coloring Trees 三维dp
- 【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
- 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方程——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 #369(Div.2) C.Coloring Trees【Dp】
- 探秘Java中String、StringBuilder以及StringBuffer
- drawBitmapMesh实现的CurtainDialog效果,一个比较屌的下落动画效果
- React+React-router+webpack重构一个微信小应用(预测宝宝2)(篇幅过长,分2次)
- Gray Code
- [笔试题] union的原理探究
- Codeforces Round #369 (Div. 2) C. Coloring Trees 数位dp,好题
- 友盟第三方登入后,进行分享,成功后退出登录,选择QQ再登录,结果程序就崩溃了!!!
- oracle数据库配置、安装、部署web应用——笔记
- 在JAVA后台和页面中只保留小数点的后两位
- canvas绘制网格(增加坐标)
- 字符串操作
- 图解LanHelper 使用
- cpp中的输出运算符
- QT 的信号与槽机制介绍