Paint the Tree --------CodeForces - 1244D

最新推荐文章于 2020-08-12 20:20:40 发布

。。。。。。。？？

最新推荐文章于 2020-08-12 20:20:40 发布

阅读量179

点赞数

文章标签：思维+深搜

本文链接：https://blog.csdn.net/weixin_45177251/article/details/102782436

版权

给定一棵树，需要使用三种颜色对其进行染色，使得任意三个相邻的节点颜色都不相同，要求染色成本最小。输入包含每节点每种颜色的成本，输出最小成本及对应染色方案。若无法满足条件则输出-1。

摘要由CSDN通过智能技术生成

You are given a tree consisting of nn vertices. A tree is an undirected connected acyclic graph.

Example of a tree.

You have to paint each vertex into one of three colors. For each vertex, you know the cost of painting it in every color.

You have to paint the vertices so that any path consisting of exactly three distinct vertices does not contain any vertices with equal colors. In other words, let's consider all triples (x,y,z)(x,y,z) such that x≠y,y≠z,x≠zx≠y,y≠z,x≠z, xx is connected by an edge with yy, and yy is connected by an edge with zz. The colours of xx, yy and zz should be pairwise distinct. Let's call a painting which meets this condition good.

You have to calculate the minimum cost of a good painting and find one of the optimal paintings. If there