题目描述
模拟
我们可以枚举在那个点被抓到,然后让石神马不停蹄的跑到那个点,接着乖乖等死。
#include<cstdio>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=200000+10;
int f[maxn][25],d[maxn];
int h[maxn],go[maxn*2],next[maxn*2];
int i,j,k,l,t,n,m,tot,ans,root,x,y;
int read(){
int x=0;
char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
return x;
}
void add(int x,int y){
go[++tot]=y;
next[tot]=h[x];
h[x]=tot;
}
void dg(int x,int y){
f[x][0]=y;
d[x]=d[y]+1;
int t=h[x];
while (t){
if (go[t]!=y) dg(go[t],x);
t=next[t];
}
}
int lca(int x,int y){
if (d[x]<d[y]) swap(x,y);
if (d[x]!=d[y]){
int j=floor(log(n)/log(2));
while (j>=0){
if (d[f[x][j]]>=d[y]) x=f[x][j];
j--;
}
}
if (x==y) return x;
int j=floor(log(n)/log(2));
while (j>=0){
if (f[x][j]!=f[y][j]){
x=f[x][j];
y=f[y][j];
}
j--;
}
return f[x][0];
}
int getdis(int x,int y){
return d[x]+d[y]-d[lca(x,y)]*2;
}
int find(int x,int y){
int j=floor(log(n)/log(2));
while (j>=0){
if (d[f[x][j]]>d[y]) x=f[x][j];
j--;
}
return x;
}
int walk(int u,int v){
int w=lca(u,v);
if (w==u) return find(v,u);else return f[u][0];
}
void dfs(int x,int y,int a,int b,int time){
int s=getdis(a,x),r,t,c,d;
r=time+s/2*3;
if (s%2) r+=2;
t=r;
s=getdis(b,x);
r=time+s/2*3;
if (s%2) r+=2;
t=min(t,r);
ans=max(ans,t);
t=h[x];
while (t){
if (go[t]!=y){
if (go[t]==a||go[t]==b){
ans=max(ans,time+1);
t=next[t];
continue;
}
c=walk(a,go[t]);
d=walk(b,go[t]);
if (c==go[t]||d==go[t]){
ans=max(ans,time+2);
t=next[t];
continue;
}
c=walk(c,go[t]);
d=walk(d,go[t]);
if (c==go[t]||d==go[t]){
ans=max(ans,time+3);
t=next[t];
continue;
}
dfs(go[t],x,c,d,time+3);
}
t=next[t];
}
}
int main(){
freopen("track.in","r",stdin);freopen("track.out","w",stdout);
n=read();root=read();x=read();y=read();
fo(i,1,n-1){
j=read();k=read();
add(j,k);add(k,j);
}
d[0]=-1;
dg(root,0);
fo(j,1,floor(log(n)/log(2)))
fo(i,1,n)
f[i][j]=f[f[i][j-1]][j-1];
dfs(root,0,x,y,0);
printf("%d\n",ans);
}