题目:
https://www.luogu.org/problem/show?pid=1967
思路:
求一个最大生成树,然后倍增;
注意:
47行的代码一定要放在46行后面;
总结:
无;
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const ll MAXN=200001;
ll fst[MAXN],nxt[MAXN],fa[MAXN][30],f[MAXN],dis[MAXN][30],deep[MAXN];
ll n,m,tot,q;
struct hh
{
ll from,to,cost;
}ma[MAXN],mp[MAXN];
ll find(ll x)
{
ll r=x,t;
while(r!=f[r]) r=f[r];
while(x!=r) t=f[x],f[x]=r,x=t;
return r;
}
void build(ll f,ll t,ll c)
{
ma[++tot]=(hh){f,t,c};
nxt[tot]=fst[f];
fst[f]=tot;
return;
}
bool cmp(hh a,hh b)
{
return a.cost>b.cost;
}
void dfs(ll x,ll f)
{
fa[x][0]=f;
deep[x]=deep[f]+1;
for(ll i=fst[x];i;i=nxt[i])
{
ll v=ma[i].to;
if(v==f) continue;
dis[v][0]=ma[i].cost;
dfs(v,x);
}
return;
}
void make_lca()
{
for(ll i=1;i<=28;i++)
for(ll j=1;j<=n;j++)
{
fa[j][i]=fa[fa[j][i-1]][i-1];
dis[j][i]=min(dis[fa[j][i-1]][i-1],dis[j][i-1]);
}
return;
}
void kruskal()
{
int cnt=0;
for(ll i=1;i<=n;i++) f[i]=i;
sort(mp+1,mp+m+1,cmp);
for(ll i=1;i<=m;i++)
{
ll fx=find(mp[i].from),fy=find(mp[i].to);
if(fx!=fy)
{
cnt++;
f[fx]=fy;
build(mp[i].from,mp[i].to,mp[i].cost);
build(mp[i].to,mp[i].from,mp[i].cost);
}
if(cnt==n-1) break;
}
return;
}
ll lca(ll x,ll y)
{
if(deep[x]<deep[y]) swap(x,y);
ll s=deep[x]-deep[y];
for(ll i=28;i>=0;i--)
if(deep[fa[x][i]]>=deep[y])
x=fa[x][i];
if(x==y) return x;
for(ll i=28;i>=0;i--)
if(fa[x][i]!=fa[y][i])
x=fa[x][i],y=fa[y][i];
return fa[x][0];
}
ll ask(ll x,ll y)
{
ll Min=2147483647999;
if(deep[x]<deep[y]) swap(x,y);
for(ll i=28;i>=0;i--)
if(deep[fa[x][i]]>=deep[y])
{
Min = min(Min,dis[x][i]);
x = fa[x][i];
}
return Min;
}
void solve()
{
scanf("%lld%lld",&n,&m);
for(ll i=1;i<=m;i++)
scanf("%lld%lld%lld",&mp[i].from,&mp[i].to,&mp[i].cost);
memset(dis,0x7f,sizeof(dis));
kruskal(),dfs(1,0);
make_lca();
scanf("%lld",&q);
while(q--)
{
ll x,y,z;
scanf("%lld%lld",&x,&y);
if(find(x)!=find(y))
{
printf("-1\n");
continue;
}
z=lca(x,y);
printf("%lld\n",min(ask(x,z),ask(y,z)));
}
return;
}
int main()
{
solve();
return 0;
}