带权并查集

最新推荐文章于 2024-07-15 18:06:38 发布

倔强小灏

最新推荐文章于 2024-07-15 18:06:38 发布

阅读量118

点赞数 1

分类专栏：知识点

知识点专栏收录该内容

14 篇文章 0 订阅

订阅专栏

https://blog.csdn.net/yjr3426619/article/details/82315133

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
const int maxN = 100005；
int parent[maxN];
int score[maxN];
int find(int x)
{
	if (x != parent[x])
	{
		int t = parent[x];
		parent[x] = find(parent[x]);
		score[x] += score[t];

	}
	return parent[x];
}
int main()

{
	int n, m, q;
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1 ; i <= n ; i ++ )
	{
		parent[i] = i;
	}
	while ( m-- )
	{
		int x, y, s;
		scanf("%d%d%d", &x, &y, &s);
		int px = find(x);
		int py = find(y);
		if (px != py)
		{
			parent[px] = py;
			score[px] = -score[x] + score[y] + s;
		}
	}
	while ( q -- )
	{
		int x, y;
		scanf("%d%d",&x,&y);
		if (find(x) != find(y))
		{

			printf("-1\n");

		}
		else {
			printf("%d\n", score[x] - score[y]);
		}
	}
	return 0;

}