CF813C.The Tag Game

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of $n$ vertices. Vertex 1 is the root of the tree.

Alice starts at vertex 1 and Bob starts at vertex $x$ ( $x≠1$ ). The moves are made in turns, Bob goes first. In one move one can either stay at the current vertex or travel to the neighbouring one.

The game ends when Alice goes to the same vertex where Bob is standing. Alice wants to minimize the total number of moves and Bob wants to maximize it.

You should write a program which will determine how many moves will the game last.

输入格式

The first line contains two integer numbers $n$ and $x$ ( $2<=n<=2·10^{5}$ , $2<=x<=n$ ).

Each of the next $n-1$ lines contains two integer numbers $a$ and $b$ ( $1<=a,b<=n$ ) — edges of the tree. It is guaranteed that the edges form a valid tree.

输出格式

Print the total number of moves Alice and Bob will make.

输入输出样例

输入#1
```
4 3
1 2
2 3
2 4
```
输出#1
```
4
```
输入#2
```
5 2
1 2
2 3
3 4
2 5
```
输出#2
```
6
```

说明/提示

In the first example the tree looks like this:

The red vertex is Alice's starting position, the blue one is Bob's. Bob will make the game run the longest by standing at the vertex 3 during all the game. So here are the moves:

B: stay at vertex 3

A: go to vertex 2

B: stay at vertex 3

A: go to vertex 3

In the second example the tree looks like this:

The moves in the optimal strategy are:

B: go to vertex 3

A: go to vertex 2

B: go to vertex 4

A: go to vertex 3

B: stay at vertex 4

A: go to vertex 4

首页