Sichuan University Programming Contest 2013 Final (Single)C题

题目链接：http://cstest.scu.edu.cn/soj/problem.action?id=4276

最小生成树。。只不过一些边已经强加给最小生成树，计算剩下的点所组成的最小生成树。直接用prime算法，先将最已经强加的边涉及到的点放在并查集中即可。

code：

#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
const int MAX = 500 + 10;

int father[MAX], n;
int x[MAX], y[MAX], h[MAX], LIM;
struct node
{
	int u;
	int v;
	int dis;
}edge[MAX*MAX];
void make()
{
	int x;
	for (x=1; x<=n; x++)
	{
		father[x] = x;
	}
}
int find(int x)
{
	if (x!=father[x])
	{
		father[x] = find(father[x]);
	}
	return father[x];
}
void merge(int x, int y)
{
	x = find(x);
	y = find(y);
	if (x==1)
	{
		father[y] = x;
	}
	else if (y == 1)
	{
		father[x] = y;
	}
	else if (x!=y)
	{
		father[x] = y;
	}
}
bool operator<(const node& a, const node& b)
{
	return a.dis < b.dis;
}

int dis(int i, int j)
{
	return abs(x[i] - x[j]) + abs(y[i] - y[j]) + abs(h[i] - h[j]);
}
int main()
{
	int t, i, j, cnt = 0, ans = 0;
	scanf("%d", &t);
	while (t--)
	{
		ans = 0;
		scanf("%d", &n);
		cnt = 0;
		n++;
		make();
		for (i=2; i<=n; i++)
		{
			scanf("%d%d%d", x+i, y+i, h+i);
		}
		scanf("%d%d%d%d", &LIM, x+1, y+1, h+1);
		for (i=2; i<=n; i++)
		{
			if (h[i]>LIM)
			{
				merge(1, i);
				ans += dis(1, i);
			}
			else
			{
				edge[++cnt].u = 1;
				edge[cnt].v = i;
				edge[cnt].dis = dis(1, i);
			}
		}
		for (i=2; i<n; i++)
		{
			for (j=i+1; j<=n; j++)
			{
				edge[++cnt].u = i;
				edge[cnt].v = j;
				edge[cnt].dis = dis(i, j);
			}
		}
		sort(edge+1, edge+cnt+1);
		for (i=1; i<=cnt; i++)
		{
			if (find(edge[i].u)!=find(edge[i].v))
			{
				merge(edge[i].u, edge[i].v);
				ans += edge[i].dis;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}