Codeforces Round #321 (Div. 2)C. Kefa and Park
2015-09-23 21:45
246 查看
C. Kefa and Park
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 consecutivevertices
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 vertexi has
a cat).
Next n - 1 lines contains the edges of the tree in the format "xi yi"
(without the quotes) (1 ≤ xi, yi ≤ n, xi ≠ yi),
where xi and yi are
the vertices of the tree, connected by an edge.
It is guaranteed that the given set of edges specifies a tree.
Output
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.
Sample test(s)
input
output
input
output
Note
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 vertex2.
Note to the second sample test:
The restaurants are located at vertices 4, 5, 6, 7. Kefa
can't go to restaurants 6, 7.
题意:从根节点1出发,到叶节点的路径没有超过连续m个点有cat的个数为多少
一个简单的DFS
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 consecutivevertices
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 vertexi has
a cat).
Next n - 1 lines contains the edges of the tree in the format "xi yi"
(without the quotes) (1 ≤ xi, yi ≤ n, xi ≠ yi),
where xi and yi are
the vertices of the tree, connected by an edge.
It is guaranteed that the given set of edges specifies a tree.
Output
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.
Sample test(s)
input
4 1 1 1 0 0 1 2 1 3 1 4
output
2
input
7 1
1 0 1 1 0 0 0
1 21 3
2 4
2 5
3 6
3 7
output
2
Note
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 vertex2.
Note to the second sample test:
The restaurants are located at vertices 4, 5, 6, 7. Kefa
can't go to restaurants 6, 7.
题意:从根节点1出发,到叶节点的路径没有超过连续m个点有cat的个数为多少
一个简单的DFS
相关文章推荐
- makefile 中的赋值
- 在Struts2中使用ValueStack、ActionContext、ServletContext、request、session等
- Linux使用笔记: 定制core dump文件的文件名
- sicily 1051. Biker's Trip Odomete
- 《2016展讯校招软开java笔试题》
- 开源协议的比较
- 简单的Velocity代码
- 浅谈网络游戏的设计——服务器端编程
- 各种LG的5.0.1的root方法(VS985 24B亲测通过)
- Python中运用正则表达式抓取网页图片
- Android访问百度网站
- Android源码解析-仿今日头条PagerSlidingTabStrip滑动页面导航效果
- HDU 3966 Aragorn's Story(树链剖分)
- data.table Way - Learning Note Part 1
- sicily 1046. Plane Spotting
- HDU 4117 GRE Words【AC自动机+线段树】
- 机房收费系统测试计划
- 无线收发模块的使用
- 编译原理学习笔记之词法分析
- 读论文