HDU 6241 Color a Tree CCPC2017 Harbin（二分答案+上下界判定）

最新推荐文章于 2022-09-07 22:01:02 发布

alpc_qleonardo

最新推荐文章于 2022-09-07 22:01:02 发布

阅读量1.4k

点赞数 1

分类专栏： ---------Online Judge-------- HDU ------------Contest----------- CCPC -----------巧妙方法----------- 二分答案文章标签： HDU CCPC 二分答案 dfs

本文链接：https://blog.csdn.net/u013534123/article/details/78523559

版权

Color a Tree

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 92 Accepted Submission(s): 17

Problem Description

Bob intends to color the nodes of a tree with a pen. The tree consists of N nodes. These nodes are numbered 1,2,...,N . The root of the tree is node 1 . The initial color of each node is white. Bob can use one unit energy to color one node into black. To prevent Bob being lazy with painting, Alice proposed A+B rules. Each rule is represent by two numbers xi and yi .
For the first A