codeforces-580C-Kefa and Park【dfs】

最新推荐文章于 2022-05-27 22:51:17 发布

VIP文章宣之于口

最新推荐文章于 2022-05-27 22:51:17 发布

阅读量1.4k

点赞数 2

分类专栏： ACM_深度优先搜索 codeforces 文章标签： 580C

本文链接：https://blog.csdn.net/loy_184548/article/details/49533187

版权

codeforces-580C-Kefa and Park

                    time limit per test2 seconds        memory limit per test256 megabytes

Kefa decided to celebrate his first big salary by going to the restaurant.

He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also contains Kefa’s house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.

The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than m consecutive vertices with cats.

Your task is to help Kefa count the number of restaurants where he can go.

Input
The first line contains two integers, n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ n) — the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa.

The second line contains n integers a1, a2, …, an, where each ai either equals to 0 (then vertex i has no cat), or equals to 1 (then vertex i has a cat).

Next n - 1 li