A10008 | Kefa and Park
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
The first line contains two integers, $n$ and $m$ ( $2<=n<=10^{5}$ , $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 $a_{1},a_{2},...,a_{n}$ , where each $a_{i}$ either equals to $0$ (then vertex $i$ has no cat), or equals to $1$ (then vertex $i$ has a cat).
Next $n-1$ lines contains the edges of the tree in the format " $x_{i}$ $y_{i}$ " (without the quotes) ( $1<=x_{i},y_{i}<=n$ , $x_{i}≠y_{i}$ ), where $x_{i}$ and $y_{i}$ are the vertices of the tree, connected by an edge.
It is guaranteed that the given set of edges specifies a tree.
The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ , where each $a_{i}$ either equals to $0$ (then vertex $i$ has no cat), or equals to $1$ (then vertex $i$ has a cat).
Next $n-1$ lines contains the edges of the tree in the format " $x_{i}$ $y_{i}$ " (without the quotes) ( $1<=x_{i},y_{i}<=n$ , $x_{i}≠y_{i}$ ), where $x_{i}$ and $y_{i}$ are the vertices of the tree, connected by an edge.
It is guaranteed that the given set of edges specifies a tree.
输出格式
A single integer — the number of distinct leaves of a tree the path to which from Kefa's home contains at most $m$ consecutive vertices with cats.
输入输出样例
输入 #1
4 1 1 1 0 0 1 2 1 3 1 4
输出 #1
2
输入 #2
7 1 1 0 1 1 0 0 0 1 2 1 3 2 4 2 5 3 6 3 7
输出 #2
2
Let us remind you that a tree is a connected graph on $n$ vertices and $n-1$ edge. A rooted tree is a tree with a special vertex called root. In a rooted tree among any two vertices connected by an edge, one vertex is a parent (the one closer to the root), and the other one is a child. A vertex is called a leaf, if it has no children.
Note to the first sample test:  The vertices containing cats are marked red. The restaurants are at vertices 2, 3, 4. Kefa can't go only to the restaurant located at vertex $2$ .
Note to the second sample test:  The restaurants are located at vertices 4, 5, 6, 7. Kefa can't go to restaurants 6, 7.
Note to the first sample test:  The vertices containing cats are marked red. The restaurants are at vertices 2, 3, 4. Kefa can't go only to the restaurant located at vertex $2$ .
Note to the second sample test:  The restaurants are located at vertices 4, 5, 6, 7. Kefa can't go to restaurants 6, 7.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted