10分kruskal+LCA求调QAQ
查看原帖
10分kruskal+LCA求调QAQ
1065103
Atri_Lobato楼主2024/8/8 19:16
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
struct Edge
{
	int x,y,z;
}te[50005];
int color[50005];
vector<Edge> edge;
int fa[50005][30];
int f[50005];
int depth[50005];
int minn[50005][30];
vector<int> pic[50005];
bool cmp(Edge a,Edge b)
{
	return a.z>b.z;
}
int find(int a)
{
	if(f[a]==a)
	{
		return a;
	}
	f[a]=find(f[a]);
	return f[a];
}
void init()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		f[i]=i;
	}
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&te[i].x,&te[i].y,&te[i].z);
	}
}
void kruskal()
{
	sort(te+1,te+1+m,cmp);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		x=te[i].x;
		y=te[i].y;
		if(find(x)!=find(y))
		{
			f[find(y)]=find(x);
			te[0].z=te[i].z;
			te[0].x=x;
			te[0].y=y;
			edge.push_back(te[0]);
			te[0].x=y;
			te[0].y=x;
			edge.push_back(te[0]);
		}
	}
	for(int i=0;i<edge.size();i++)
	{
		pic[edge[i].x].push_back(i);
	}
}
void dfs(int now,int father,int v,int c)
{
	color[now]=c;
	fa[now][0]=father;
	depth[now]=depth[father]+1;
	minn[now][0]=v;
	for(int i=1;i<=20;i++)
	{
		fa[now][i]=fa[fa[now][i-1]][i-1];
		minn[now][i]=min(minn[now][i-1],minn[fa[now][i-1]][i-1]);
	}
	for(int i=0;i<pic[now].size();i++)
	{
		int next=edge[pic[now][i]].y;
		int z=edge[pic[now][i]].z;
		if(next==father)
		continue;
		dfs(next,now,z,c);
	}
}
int LCA(int x,int y)
{
	int ans=1e9;
	if(depth[x]<depth[y])
	swap(x,y);
	for(int i=20;i>=0;i--)
	{
		if(depth[fa[x][i]]>=depth[y])
		{
			ans=min(ans,minn[x][fa[x][i]]);
			x=fa[x][i];
		}
	}
	if(x==y)
	return ans;
	for(int i=20;i>=0;i--)
	{
		if(fa[x][i]!=fa[y][i])
		{
			ans=min(ans,minn[x][i]);
			ans=min(ans,minn[y][i]);
			x=fa[x][i];
			y=fa[y][i];
		}
	}
	return min(ans,min(minn[x][0],minn[y][0]));
}
int main()
{
	init();
	memset(minn,127,sizeof(minn));
	kruskal();
	int c=1;
	for(int i=1;i<=n;i++)
	{
		if(color[i]==0)
		dfs(i,0,999999,c);
		c++;
	}
	int q;
	scanf("%d",&q);
	while(q--)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		if(color[x]==color[y])
		{
			printf("%d\n",LCA(x,y));
		}
		else
		{
			printf("-1\n");
		}
	}
	return 0;
}
2024/8/8 19:16
加载中...