Codeforces#321 (Div. 2) C. Kefa and Park（dfs）

 

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 ≤ 10⁵, 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₁, a₂, ..., 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.

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

题意：地图是一棵树，从根（点1）出发，要到叶子去，路上连续有m个点有猫的路不走，求有多少路可以走。

思路：很水的dfs，构造边的时候记录下度数，用于判断是否为叶子就好了。

#include
#include
#include
#include
using namespace std;

const int MAXN = 100000 + 1000;
vectorG[MAXN];
int father[MAXN];
int isleaf[MAXN];
int node[MAXN];
bool vis[MAXN];
int iscat[MAXN];

int n, m;
int cnt;

void init()
{
    for (int i = 0; i <= n ; i++)
    {
        father[i] = i;
        isleaf[i] = 0;
        vis[i] = false;
        G[i].clear();
    }
}

void bind(int u, int v)
{
    isleaf[u]++;
    isleaf[v]++;
    G[u].push_back(v);
    G[v].push_back(u);
}

void dfs(int x, int cat)
{
    if (vis[x]) return;
    else vis[x] = true;
    if (iscat[x]) cat++;
    else cat = 0;
    if (cat > m) return;
    if (isleaf[x]<2 && x!=1)
        cnt++;
    for (int i = 0; i < G[x].size(); i++)
    {
        dfs(G[x][i], cat);
    }
    return;
}

int main()
{
    while (scanf("%d%d", &n, &m) != EOF)
    {
        for (int i = 1; i <= n; i++)
            scanf("%d", &iscat[i]);
        int u, v;
        cnt = 0;
        init();
        for (int i = 0; i < n - 1; i++)
        {
            scanf("%d%d", &u, &v);
            bind(u, v);
        }
    
        dfs(1, 0);

        printf("%d\n", cnt);
        
    }
}