ZOJ 2966 Build The Electric System【最小生成树】

最新推荐文章于 2011-08-21 00:56:14 发布

WGH_yesterday

最新推荐文章于 2011-08-21 00:56:14 发布

阅读量624

点赞数

分类专栏：水题最小生成树 ZOJ 并查集文章标签： system build struct ie c

本文链接：https://blog.csdn.net/WGH_yesterday/article/details/6698994

版权

水题同时被 3 个专栏收录

109 篇文章 0 订阅

订阅专栏

ZOJ

94 篇文章 0 订阅

订阅专栏

最小生成树

12 篇文章 0 订阅

订阅专栏

//2632030 	2011-08-18 16:57:56 	Accepted 	2966 	C++ 	0 	1652 	ylwh@Unknown
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
using namespace std;
#define N 501
struct edge
{
	int x, y, cost;
}e[N * N / 2];
int root[N];
int find_root(int x)
{
	int temp = x;
	while(temp != root[temp])
		temp = root[temp];
	root[x] = temp;
	return temp;
}
int cmp(struct edge a, struct edge b)
{
	return a.cost < b.cost;
}
int main()
{
	int t, n, E, i, j, a, b, x, y, cnt, ans;
	scanf("%d", &t);
	while(t--)
	{
		cnt = -1;
		ans = 0;
		scanf("%d%d", &n, &E);
		for(i=0; i<n; i++)
			root[i] = i;
		for(i=0; i<E; i++)
		{
			scanf("%d%d%d", &x, &y, &j);
			if(j)
			{
				e[++cnt].x = x;
				e[  cnt].y = y;
				e[  cnt].cost = j;
			}
			else
			{
				a = find_root(x);
				b = find_root(y);
				if(a > b)
					root[a] = b;
				else if(a < b)
					root[b] = a;
			}
		}
		sort(e, e + cnt + 1, cmp);
		for(i=0; i<=cnt; i++)
		{
			a = find_root(e[i].x);
			b = find_root(e[i].y);
			if(a != b)
			{
				ans += e[i].cost;
				if(a > b)
					root[a] = b;
				else
					root[b] = a;
			}
		}
		printf("%d\n", ans);
	}
    return 0;
}