Codeforces 739B Alyona and a tree （树上差分+二分）

最新推荐文章于 2020-12-02 19:21:35 发布

键盘里的青春

最新推荐文章于 2020-12-02 19:21:35 发布

阅读量1.1k

点赞数 1

分类专栏： CF 二分 ACM技巧 ACM

本文链接：https://blog.csdn.net/qq_34374664/article/details/70246427

版权

博客介绍了如何利用树上差分和二分查找解决Codeforces 739B问题，即在给定树结构中计算每个节点控制的其他节点数量。题目提供了一个包含节点权重和边权重的树，控制定义为路径上的权重之和小于等于节点自身的权重。解决方案包括深度优先搜索和在线性时间内更新控制数量。

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

D. Alyona and a tree

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Alyona has a tree with n vertices. The root of the tree is the vertex 1. In each vertex Alyona wrote an positive integer, in the vertex i she wrote ai. Moreover, the girl wrote a positive integer to every edge of the tree (possibly, different integers on different edges).

Let's define dist(v, u) as the sum of the integers written on the edges of the simple path from v to u.

The vertex v controls the vertex u (v ≠ u) if and only if u is in the subtree of v and dist(v, u) ≤ au.

Alyona wants to settle in some vertex. In order to do this, she wants to know for each vertex v what is the number of vertices u such that vcontrols u.

Input

The first line contains single integer