题目描述:
qwq。
题目分析:
求出3个点两两的LCA
有两个是相同的选另一个作为聚会地点
然后算距离
树剖LCA快的飞起qwq
题目链接:
Ac 代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
const int maxm=510000;
int head[maxm],to[maxm<<1],net[maxm<<1],cost[maxm];
int cnt;
int n,m;
inline void addedge(int u,int v)
{
cnt++;
to[cnt]=v,net[cnt]=head[u],head[u]=cnt;
}
int fa[maxm],son[maxm],top[maxm],siz[maxm],id[maxm],dis[maxm],deep[maxm],tot;
void dfs1(int now,int fax,int dep)
{
fa[now]=fax,deep[now]=dep;
siz[now]=1,son[now]=0;
for(int i=head[now];i;i=net[i])
if(to[i]!=fax)
{
dfs1(to[i],now,dep+1);
siz[now]+=siz[to[i]];
if(siz[to[i]]>siz[son[now]]) son[now]=to[i];
}
}
void dfs2(int now,int topx)
{
top[now]=topx;
id[now]=++tot;
if(son[now]) dfs2(son[now],topx);
for(int i=head[now];i;i=net[i])
if(!id[to[i]])
dfs2(to[i],to[i]);
}
inline int LCA(int u,int v)
{
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
u=fa[top[u]];
}
return deep[u]<deep[v]?u:v;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<n;i++)
{
int u,v,c;
scanf("%d%d",&u,&v);
addedge(u,v),addedge(v,u);
}
dfs1(1,0,0);
dfs2(1,1);
for(int i=1;i<=m;i++)
{
int s1,s2,s3;
scanf("%d%d%d",&s1,&s2,&s3);
int lca1=LCA(s1,s2),lca2=LCA(s2,s3),lca3=LCA(s1,s3);
int zlca;
if(lca1==lca2) zlca=lca3;
if(lca2==lca3) zlca=lca1;
if(lca1==lca3) zlca=lca2;
printf("%d %d\n",zlca,deep[s1]+deep[s2]+deep[s3]+3*deep[zlca]-2*(deep[LCA(s1,zlca)]+deep[LCA(s2,zlca)]+deep[LCA(s3,zlca)]));
}
}