hdu-6074 Phone Call (LCA+并查集)

题意：

给出若干条电话线，询问可以最多连几个房子，最小代价

思路：

按照题解学的。

先将轻重链划分出来，不仅仅是为了找LCA，也是为了在合并的时候以轻重链logn的特点，不断合并。

划分为若干条轻重链后，用最小生成树的思想来构造，在（a,b）这个区间内，区间内自己连接，也就是找到a,b的LCA，之后合并到LCA上！c.d同理

在a,b 与c,.d的关系上，只需要直接调用fa【】 合并即可。并查集合并时维护cnt与cost

#include<cstdio>
#include<algorithm>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 100010;
int siz[maxn], fa[maxn], son[maxn], top[maxn], ced[maxn];
int cnt[maxn], same[maxn],ft[maxn];
long long cost[maxn];
const int N = 100010;
struct node
{
	int a, b, c, d, w;
	friend bool operator <(node x, node y)
	{
		return x.w<y.w;
	}
}e[maxn];
int tot = 0;
int head[maxn];
vector <int > vec[maxn];
void add(int u, int v)
{
	vec[u].push_back(v);
	vec[v].push_back(u);
}
void dfs1(int u, int f, int d)
{
	siz[u] = 1;
	ft[u] = f;
	ced[u] = d;
	son[u] = 0;
	for (int i = 0; i<vec[u].size(); i++)
	{
		int v = vec[u][i];
		if (v == f)
			continue;
		dfs1(v, u, d + 1);
		siz[u] += siz[v];
		if (siz[v]>siz[son[u]])
			son[u] = v;
	}
}
void dfs2(int u, int f)
{
	top[u] = f;
	if (son[u])
		dfs2(son[u], f);
	for (int i = 0; i<vec[u].size(); i++)
	{
		int v = vec[u][i];
		if (v == ft[u] || v == son[u])
			continue;
		dfs2(v, v);
	}
}
int lca(int u, int v)
{
	while (top[u] != top[v])
	{
		if (ced[top[u]]<ced[top[v]])
			swap(u, v);
		u = ft[top[u]];
	}
	if (ced[u]<ced[v])
		return u;
	else
		return v;
}
int Same(int x)
{
	if (same[x] != x)
		same[x] = Same(same[x]);
	return same[x];
}
int Find(int x)
{
	if (fa[x] != x)
		fa[x] = Find(fa[x]);
	return fa[x];
}
void Union(int x, int y, int w)
{
	int r1 = Find(x);
	int r2 = Find(y);
	if (r1 != r2)
	{
		fa[r1] = r2;
		cnt[r2] += cnt[r1];
		cost[r2] += cost[r1] + w;
	}
}
void go(int u, int v, int w)
{
	while (1)
	{
		u = Same(u);
		if (ced[u] <= ced[v])
			return;
		Union(u, ft[u], w);
		same[u] = ft[u];
	}
}
void chain(int u, int v, int w)
{
	int z = lca(u, v);
	go(u, z, w);
	go(v, z, w);
}
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int n, m;
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; i++)
			same[i] = fa[i] = i, cnt[i] = 1, cost[i] = 0;
		for (int i = 0; i<maxn; i++)
			vec[i].clear(), fa[i] = same[i] = i;
		memset(top, 0, sizeof(top));
		memset(son, 0, sizeof(son));
		memset(ced, 0, sizeof(ced));
		memset(siz, 0, sizeof(siz));

		for (int i = 1; i<n; i++)
		{
			int u, v;
			scanf("%d%d", &u, &v);
			add(u, v);
		}
		dfs1(1, 1, 1);
		dfs2(1, 1);
		for (int i = 1; i <= m; i++)
			scanf("%d%d%d%d%d", &e[i].a, &e[i].b, &e[i].c, &e[i].d, &e[i].w);
		sort(e + 1, e + m + 1);
		for (int i = 1; i <= m; i++)
		{
			int w = e[i].w;
			chain(e[i].a, e[i].b, w);
			chain(e[i].c, e[i].d, w);
			Union(e[i].a, e[i].c, w);
		}
		int k=Find(1);
		printf("%d %lld\n", cnt[k], cost[k]);
	} 
	return 0;
}