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

原创 2016年08月30日 14:00:41

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.

dp[i][j][k]表示前i棵树,第i棵的颜色是j,之前总共有k段,的最小花费。
那么考虑i-1棵树,如果颜色相同,则段数不变。否则就要新开一段。
dp[i][j][k]=min{dp[i-1][j][k],dp[i-1][x][k-1] (x!=j)}(+cost[i][j])
如果这一段是空白,j可以任取,最后还要加上费用。
否则j已经定好,不用加费用。
最后的答案是min{dp[n][x][k]}
注意边界条件和初始化。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
LL dp[110][110][110],cost[110][110];
int a[110];
int main()
{
    int i,j,k,m,n,p,q;
    LL x,y,z,oo,ans;
    scanf("%d%d%d",&n,&m,&k);
    for (i=1;i<=n;i++)
      scanf("%d",&a[i]);
    for (i=1;i<=n;i++)
      for (j=1;j<=m;j++)
        scanf("%I64d",&cost[i][j]);
    memset(dp,0x3f,sizeof(dp));
    oo=dp[1][1][1];
    if (a[1]) dp[1][a[1]][1]=0;
    else
    {
        for (i=1;i<=m;i++)
          dp[1][i][1]=cost[1][i];
    }
    for (i=2;i<=n;i++)
      for (j=1;j<=m;j++)
        for (p=1;p<=i&&p<=k;p++)
        {
            if (a[i]&&a[i]!=j) continue;
            dp[i][j][p]=dp[i-1][j][p];
            for (q=1;q<=m;q++)
              if (q!=j)
                dp[i][j][p]=min(dp[i][j][p],dp[i-1][q][p-1]);
            if (!a[i]) dp[i][j][p]+=cost[i][j];
        }
    ans=oo;
    for (i=1;i<=m;i++)
      ans=min(ans,dp[n][i][k]);
    if (ans==oo) printf("-1\n");
    else printf("%I64d\n",ans);
}
版权声明:本文为博主原创文章,未经博主允许不得转载,欢迎添加友链。

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 732E】【贪心 map乱搞】

传送门:http://codeforces.com/contest/732/problem/E 描述: E. Sockets time limit per t...
  • guhaiteng
  • guhaiteng
  • 2016年10月22日 15:32
  • 538

codeforces上一种应对大测试数据debug方法

接触codeforces时间不长,也就参加了10场左右。之前有次比赛就出现了wa了一道题,在比赛结束后看测试数据log时,发现出错的那组用例是个超过一万行输入的情况,codeforces上的测试数据无...
  • qq_29070399
  • qq_29070399
  • 2017年02月03日 16:09
  • 757

关于codeforces比赛规则介绍(转载)

Codeforces 简称: cf(所以谈论cf的时候经常被误会成TX的那款游戏). 网址: codeforces.com   这是一个俄国的算法竞赛网站,由来自萨拉托夫州立大学、由Mike Mirz...
  • y990041769
  • y990041769
  • 2014年02月19日 08:41
  • 15538

python爬虫抓取codeforces分数

环境介绍 python 2.7.2 re 正则表达式库 urllib2 代码#coding:utf8 import sys import urllib2,redef getrating(name): ...
  • qscqesze
  • qscqesze
  • 2016年11月17日 22:02
  • 463

Codeforces 708D 费用流 (呃我们的考试题)

NB的题目背景 输入输出一样考试的时候貌似只有gzz一个人搞出来了 %gzz思路: 分情况讨论 add(x,y,C,E) C是费用 E是流量 1. f>c add(x,y,2,inf),...
  • qq_31785871
  • qq_31785871
  • 2017年01月05日 17:56
  • 725

【Codeforces708C】【树形dp】【贪心】Centroids

Centroids Time Limit: 4000MS Memory Limit: 524288KB 64bit IO Format: %I64d & %I64u ...
  • u011327397
  • u011327397
  • 2016年10月14日 11:24
  • 423

CodeForces 165C--字符串(暴力)

题意: 给一个数字 k (k k 的子串? 输入: 1       1010 2       01010 100   01010 输出: 6 4 0 分析:直接暴...
  • shao1996
  • shao1996
  • 2016年07月14日 16:08
  • 162

关于codeforces比赛规则介绍(转载)

Codeforces 简称: cf(所以谈论cf的时候经常被误会成TX的那款游戏). 网址: codeforces.com   这是一个俄国的算法竞赛网站,由来自萨拉托夫州立大学、由Mike M...
  • liujian20150808
  • liujian20150808
  • 2016年01月24日 22:13
  • 482
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【Codeforces Round #369 (Div. 2)】Codeforces 711C Coloring Trees
举报原因:
原因补充:

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