CodeForces - 682C Alyona and the Tree （DFS）

最新推荐文章于 2020-12-14 08:24:01 发布

YOONGI

最新推荐文章于 2020-12-14 08:24:01 发布

阅读量211

点赞数

分类专栏： CodeForces 搜索

本文链接：https://blog.csdn.net/chimchim04/article/details/97784754

版权

博客介绍了CodeForces的一道竞赛题目，关于一棵带有边权和点权的魔法树，Alyona需要移除使节点悲伤的叶子节点。节点u若其任意子节点到u的距离大于u的点权，则u为悲伤节点。任务是找到最少需要移除的叶子节点数。文章包含问题描述、示例、思路解析以及使用DFS的解题代码。

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

Alyona and the Tree

Alyona decided to go on a diet and went to the forest to get some apples. There she unexpectedly found a magic rooted tree with root in the vertex 1, every vertex and every edge of which has a number written on.

The girl noticed that some of the tree's vertices are sad, so she decided to play with them. Let's call vertex v sad if there is a vertex u in subtree of vertex vsuch that dist(v, u) > au, where au is the number written on vertex u, dist(v, u) is the sum of the numbers written on the edges on the path from v to u.

Leaves of a tree are vertices connected to a single vertex by a single edge, but the root of a tree is a leaf if and only if the tree consists of a single vertex — roo