Kefa and Park CodeForces - 580C

传送门

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 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.

Examples


题意：就是一个树的应用，一个人想到这个树的叶子结点，但是在路途中结点处有猫，他不想经过连续m个点都有猫的路径，问如果不经过有连续m个结点处有猫的情况，他能到达几个叶子结点。
dfs遍历一遍如果到达叶子结点的时候还没有遇到超过m个猫的话那么就++，如果超过的话就return 。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=2e5+6;
vector<int> v[maxn];
int vis[maxn],m,su=0,n,tag[maxn];
void dfs(int k,int sum)
{
	tag[k]=1;
	if(sum>m) return ;
	int flag=0;
	for(int i=0;i<v[k].size();i++)
	{
		int s=v[k][i];
		if(tag[s]==0)
		{
			flag=1;
			if(vis[s]==1)//有连续的猫
			{
				dfs(s,sum+1);
			}
			else//没有连续的猫
			{
				dfs(s,0);
			}
		}
	}
	if(flag==0)
	{
		su++;能够到达的数++
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	su=0;
	memset(tag,0,sizeof(tag));
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&vis[i]);	
	}
	for(int i=1;i<=n-1;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		v[x].push_back(y);//存图
		v[y].push_back(x);
	}
	dfs(1,vis[1]);
	printf("%d\n",su);
	return 0;
}