并查集--HDU - 4313 Matrix

最新推荐文章于 2024-09-25 10:36:42 发布

epsilon1

最新推荐文章于 2024-09-25 10:36:42 发布

阅读量593

点赞数

分类专栏：算法文章标签：算法 c++

本文链接：https://blog.csdn.net/qq_20480611/article/details/49486917

版权

算法专栏收录该内容

141 篇文章 2 订阅

订阅专栏

Description

Machines have once again attacked the kingdom of Xions. The kingdom of Xions has N cities and N-1 bidirectional roads. The road network is such that there is a
unique path between any pair of cities.

Morpheus has the news that K Machines are planning to destroy the whole kingdom. These Machines are initially living in K different cities of the kingdom and
anytime from now they can plan and launch an attack. So he has asked Neo to destroy some of the roads to disrupt the connection among Machines. i.e after destroying those roads there should not be any path between any two Machines.

Since the attack can be at any time from now, Neo has to do this task as fast as possible. Each road in the kingdom takes certain time to get destroyed and they
can be destroyed only one at a time.

You need to write a program that tells Neo the minimum amount of time he will require to disrupt the connection among machines.

Input

The first line is an integer T represents there are T test cases. (0<T <=10)
For each test case the first line input contains two, space-separated integers, N and K. Cities are numbered 0 to N-1. Then follow N-1 lines, each containing three, space-separated integers, x y z, which means there is a bidirectional road connecting city x and city y, and to destroy this road it takes z units of time.Then follow K lines each containing an integer. The ith integer is the id of city in which ith Machine is currently located.
2 <= N <= 100,000
2 <= K <= N
1 <= time to destroy a road <= 1000,000

Output

For each test case print the minimum time required to disrupt the connection among Machines.

Sample Input

Sample Output

分析：并查集逆向处理，n个结点n-1条边，图的生成树，假设初始每个结点都是独立的，按权值从大到小考察每条边，如果两个结点的子树中machine个数和小于1则合并这两个结点，否则删除该边；处理的过程中可以令根结点的值为-1，则1-根结点值就是子树中machine个数。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100000 + 10;
struct Node { int x, y, w; };
int p[maxn];
Node node[maxn];

bool cmp(const Node& a, const Node& b)
{
    return a.w > b.w;
}

int find_set(int x)
{
	return p[x]<0?x:(p[x]=find_set(p[x]));
}

int main()
{
	int T;
	scanf("%d", &T);
	while(T--) {
		memset(p, -1, sizeof(p));
		int n, m;
		scanf("%d%d", &n, &m);
        for(int i=0; i<n-1; i++) {
			scanf("%d%d%d", &node[i].x, &node[i].y, &node[i].w);
        }
        for(int i=0; i<m; i++) {
            int mac;
            scanf("%d", &mac);
            p[mac] = -2;
        }
		sort(node, node+n-1, cmp);
		long long cnt = 0;
        for(int i=0; i<n-1; i++) {
            int x = find_set(node[i].x);
            int y = find_set(node[i].y);
            if(p[x]+p[y]>=-3) {
                p[x] += p[y]+1;
                p[y] = x;
            } else {
                cnt += node[i].w;
            }
        }
        printf("%lld\n", cnt);
	}
    return 0;
}