每一次lca求距离,并查集维护是否已经经过过,每一次往上跳就好了,只不过。。。为毛我这么慢?lca倍增太慢了?
#include<cstdio>
#include<cstring>
#include<iostream>
#define maxn 500021
#define LL long long
using namespace std;
void read(int& x){
x=0;char c=getchar();
for(;c>'9'||c<'0';c=getchar());
for(;c>='0'&&c<='9';c=getchar())x=x*10+c-'0';
}
int head[maxn],tot=1,n,m,fa[maxn],h[maxn],f[maxn][21],st;
LL ans;
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
struct edge{int v,next;}e[maxn*2];
void adde(int a,int b){e[tot].v=b,e[tot].next=head[a];head[a]=tot++;}
void dfs(int u,int ff){
f[u][0]=ff;h[u]=h[ff]+1;
for(int i=1;i<=17;i++)f[u][i]=f[f[u][i-1]][i-1];
for(int v,i=head[u];i;i=e[i].next){
if((v=e[i].v)==ff)continue;
dfs(v,u);
}
}
int lca(int a,int b){
if(h[a]>h[b])swap(a,b);
for(int i=17;i>=0;i--)if(h[f[b][i]]>=h[a])b=f[b][i];
if(a==b)return a;
for(int i=17;i>=0;i--){
if(f[a][i]==f[b][i])continue;
a=f[a][i],b=f[b][i];
}return f[a][0];
}
void oper(int a,int b,int g){
a=fa[a],b=fa[b];
while(h[a]>=h[g]){
fa[a]=fa[f[a][0]];a=fa[a];
}
while(h[b]>=h[g]){
fa[b]=fa[f[b][0]];b=fa[b];
}
}
int main(){
read(n),read(m),read(st);
for(int a,b,i=1;i<n;i++){
read(a),read(b);
adde(a,b),adde(b,a);
}dfs(1,0);
int last=st,now,g;
for(int i=1;i<=n;i++)fa[i]=i;
while(m--){
read(now);
if(find(now)!=now)continue;
g=lca(last,now);
ans+=h[last]+h[now]-2*h[g];
oper(last,now,g);last=now;
}printf("%lld",ans);
return 0;
}