The Tag Game（CodeForces - 813C）

The Tag Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The first line contains two integer numbers n and x (2 ≤ n ≤ 2·105, 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.

Output

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

Examples

input

4 3
1 2
2 3
2 4

output

4

input

5 2
1 2
2 3
3 4
2 5

output

6

Note

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

题意理解： Alice在1开始，而Bob在除一以外的任何一条路开始，Alice想尽快到达Bob的位置，而Bob想尽量让Alice多走路程，来找到他，他们是每人一次走一步。

解题思路 ：我标记好每个点能走到的最大深度，以及这个点的深度，我需要找的是，Alice到Bob的路程上的哪个点的最大深度是最大的，而且Bob必须要比Alice先到达该店才可以。不然此点作废。

#include<stdio.h>
#include<vector>
using namespace std;
vector<int>p[201000];
int pe[201000];
int max_deep[200100],now_deep[200100];
void dfs(int now,int pre,int deep)
{
    max_deep[now]=deep;
    now_deep[now]=deep;
    pe[now]=pre;
    int temp=p[now].size();
    for(int i=0;i<temp;i++)
    {
        int tmp=p[now][i];
        if(tmp!=pre)
        {
            dfs(tmp,now,deep+1);
            max_deep[now]=max(max_deep[now],max_deep[tmp]);   //这里是这道题的核心，这种标记最大值得方法很值得学习
        }
    }
}
int main()
{
    int n,x;
    scanf("%d%d",&n,&x);
    for(int i=0;i<n-1;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        p[a].push_back(b);
        p[b].push_back(a);
    }
    dfs(1,1,0);
    int temp=max_deep[x];
    int tmp=now_deep[x];
    for(int k=x,i=0;i<tmp;i++,k=pe[k])
    {
         if(i<now_deep[k])
         {
             temp=max(max_deep[k],temp);
         }
         else
         {
             break;
         }
    }
    printf("%d\n",temp*2);
}