CodeForces - 813C The Tag Game （BFS）

The Tag Game   

题目链接：http://codeforces.com/problemset/problem/813/C

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

 

 

题目大意：有n个点，n-1条边，Alice在点1，Bob在点K，Bob跑Alice追，问Alice追上Bob时，Alice和Bob的总步数

思路：以Alice追上Bob为终点，所以总步数就是Alice走的步数的两倍，两遍BFS，记录A和B到各点的最小步数，再找到可到达的点中步数最大的，如果有一点x ，Ax<=Bx 说明A和B会提前遇到所以不管这个点

 

代码：

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
const int N=200005;
int first[N],d1[N],d2[N],vis[N];
int tot;
struct node
{
    int v,next;
}e[N*2];
void add(int u,int v)
{
    e[tot].v=v,e[tot].next=first[u];
    first[u]=tot++;
}
void bfs_A(int st)
{
    memset(vis,0,sizeof(vis));
    queue<int>q;
    q.push(st);
    vis[st]=1;
    d1[st]=0;
    while(!q.empty())
    {
        st=q.front();
        q.pop();
        for(int i=first[st];i!=-1;i=e[i].next)
        {
            int v=e[i].v;
            if(!vis[v])
            {
                q.push(v);
                vis[v]=1;
                d1[v]=d1[st]+1;
//                printf("%d %d\n",v,d1[v]);
            }
        }
    }
}
void bfs_B(int st)
{
    memset(vis,0,sizeof(vis));
    queue<int>q;
    q.push(st);
    vis[st]=1;
    d2[st]=0;
    while(!q.empty())
    {
        st=q.front();
        q.pop();
        for(int i=first[st];i!=-1;i=e[i].next)
        {
            int v=e[i].v;
            if(!vis[v])
            {
                q.push(v);
                vis[v]=1;
                d2[v]=d2[st]+1;
//                printf("%d %d\n",v,d2[v]);
            }
        }
    }
}
int main()
{
    tot=0;
    memset(first,-1,sizeof(first));
    int n,k,u,v;
    scanf("%d%d",&n,&k);
    for(int i=0;i<n-1;i++)
    {
        scanf("%d%d",&u,&v);
        add(u,v);
        add(v,u);
    }
//    printf("\n\n");
    bfs_A(1);
//    printf("\n\n");
    bfs_B(k);
    int ans=0;
    for(int i=1;i<=n;i++)
        if(d2[i]<d1[i])
            ans=max(ans,d1[i]*2);
    printf("%d\n",ans);
    return 0;
}