CF1042F.Leaf Sets

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given an undirected tree, consisting of $n$ vertices.

The vertex is called a leaf if it has exactly one vertex adjacent to it.

The distance between some pair of vertices is the number of edges in the shortest path between them.

Let's call some set of leaves beautiful if the maximum distance between any pair of leaves in it is less or equal to $k$ .

You want to split all leaves into non-intersecting beautiful sets. What is the minimal number of sets in such a split?

输入格式

The first line contains two integers $n$ and $k$ ( $3 \le n \le 10^6$ , $1 \le k \le 10^6$ ) — the number of vertices in the tree and the maximum distance between any pair of leaves in each beautiful set.

Each of the next $n - 1$ lines contains two integers $v_i$ and $u_i$ ( $1 \le v_i, u_i \le n$ ) — the description of the $i$ -th edge.

It is guaranteed that the given edges form a tree.

输出格式

Print a single integer — the minimal number of beautiful sets the split can have.

输入输出样例

输入#1
```
9 3
1 2
1 3
2 4
2 5
3 6
6 7
6 8
3 9
```
输出#1
```
2
```
输入#2
```
5 3
1 2
2 3
3 4
4 5
```
输出#2
```
2
```
输入#3
```
6 1
1 2
1 3
1 4
1 5
1 6
```
输出#3
```
5
```

说明/提示

Here is the graph for the first example:

首页