CF - 580C. Kefa and Park - dfs判重

1.题目描述：

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

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

2.题意概述：

给你一颗树，小明住在根节点（编号为1），每个叶子节点为一个餐馆，小明很饿想去餐馆吃饭，但是它又很怕猫，因此如果它走的路径连续出现m只猫则他会被吓跑（即该路径不合法），问你小明最终可以去几个餐馆？

3.解题思路：

一开始看X题了，没注意连续这个单词（m consecutive vertices ），写了个带状态的bfs，WA声一片。

其实去搜一棵树路径可以首先考虑dfs，终止条件就是到叶子节点（度为1，注意：根节点入度也可能为1）那么直接从根节点开始dfs，用state记录当前连续出现的猫，如果当前道路没有猫则state = 0，否则state + 1。到达叶子节点（因为dfs要双向建边，所以 e[v].size() = 1）则更新可到达餐馆数。

但是我尝试沿着开始思路bfs去搜，居然wa在第26个用例，至今没发现为什么QAQ

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
vector<int> mp[maxn];
int n, m, ans, a[maxn];
/*
struct que
{
	int cur, state;
	que(int a, int b) { cur = a; state = b; }
};
bool vis[maxn];
void bfs(int sta)
{
	queue<que> q;
	vis[sta] = 1;
	q.push(que(sta, 1));
	while (!q.empty())
	{
		que cur = q.front();
		q.pop();
		int state = cur.state;
		if (state > m)
			continue;
		int u = cur.cur;
		int sz = mp[u].size();
		if (sz == 1 && u != sta)
			ans++;
		for (int i = 0; i < sz; i++)
		{
			int v = mp[u][i];
			if (!vis[v])
			{
				vis[v] = 1;
				if (a[v])
					q.push(que(v, state + 1));
				else
					q.push(que(v, 0));
			}
		}
	}
}
*/
void dfs(int u, int cnt, int pre)
{
	int sz = mp[u].size();
	for (int i = 0; i < sz; i++)
	{
		int v = mp[u][i];
		if (v == pre)
			continue;
		if (!a[v])
		{
			if (mp[v].size() == 1)
				ans++;
			dfs(v, 0, u);
		}
		else if (cnt + 1 <= m)
		{
			if (mp[v].size() == 1)
				ans++;
			dfs(v, cnt + 1, u);
		}
	}
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	while (~scanf("%d%d", &n, &m))
	{
		for (int i = 1; i <= n; i++)
		{
			mp[i].clear();
		//	vis[i] = 0;
			scanf("%d", &a[i]);
		}
		for (int i = 0; i < n - 1; i++)
		{
			int x, y;
			scanf("%d%d", &x, &y);
			mp[x].push_back(y);
			mp[y].push_back(x);
		}
		ans = 0;
		dfs(1, a[1], -1);
		printf("%d\n", ans);
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}