Rumor-递归-并查集（优化+）

Rumor-递归-并查集（优化+）

Time limit：2000 ms Memory limit：262144 kB Source: Educational Codeforces Round 33 (Rated for Div. 2) Tags: dfs and similar graphs greedy *1300 Editorial: Announcement #1 (en) Announcement #2 (ru) Tutorial #1 (en) Tutorial #2 (ru)

描述

Vova promised himself that he would never play computer games… But recently Firestorm — a well-known game developing company — published their newest game, World of Farcraft, and it became really popular. Of course, Vova started playing it.

Now he tries to solve a quest. The task is to come to a settlement named Overcity and spread a rumor in it.

Vova knows that there are n characters in Overcity. Some characters are friends to each other, and they share information they got. Also Vova knows that he can bribe each character so he or she starts spreading the rumor; i-th character wants ci gold in exchange for spreading the rumor. When a character hears the rumor, he tells it to all his friends, and they start spreading the rumor to their friends (for free), and so on.

The quest is finished when all n characters know the rumor. What is the minimum amount of gold Vova needs to spend in order to finish the quest?

Take a look at the notes if you think you haven’t understood the problem completely.

输入

The first line contains two integer numbers n and m (1 ≤ n ≤ 105, 0 ≤ m ≤ 105) — the number of characters in Overcity and the number of pairs of friends.

The second line contains n integer numbers ci (0 ≤ ci ≤ 109) — the amount of gold i-th character asks to start spreading the rumor.

Then m lines follow, each containing a pair of numbers (xi, yi) which represent that characters xi and yi are friends (1 ≤ xi, yi ≤ n, xi ≠ yi). It is guaranteed that each pair is listed at most once.

输出

Print one number — the minimum amount of gold Vova has to spend in order to finish the quest.

Input

5 2
2 5 3 4 8
1 4
4 5

Output

10

Input

10 0
1 2 3 4 5 6 7 8 9 10

Output

55

Input

10 5
1 6 2 7 3 8 4 9 5 10
1 2
3 4
5 6
7 8
9 10

Output

15

提示

In the first example the best decision is to bribe the first character (he will spread the rumor to fourth character, and the fourth one will spread it to fifth). Also Vova has to bribe the second and the third characters, so they know the rumor.

In the second example Vova has to bribe everyone.

In the third example the optimal decision is to bribe the first, the third, the fifth, the seventh and the ninth characters.

代码

#include <bits/stdc++.h>

#define PI 3.14159265358979383246
#define LL long long
#define INF 0x3f3f3f3f  

#define _for(i, a) for(int i = 0; i < (a); ++i)
#define _rep(i, a, b) for(int i = (a); i < (b); ++i)
#define _forit(a, b) for(a::iterator it = b.begin(); it != b.end(); it++)

using namespace std;

int fa[100005], a, b, m, n, p, pri[100005];

void build(int qwq) {
	for (int i = 1; i <= qwq; i++)
		fa[i] = i;
	return;
}//初始化，一开始每个点单独成集合 

int find(const int &x) {
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}//找到x的最远祖先，并且压缩路径

void mer(const int &x, const int &y) {
	if (find(x) != find(y))
		fa[fa[x]] = fa[y];
	return;
}//合并x,y，我们在判断x和y是不是同一个集合里，路径压缩之后fa[x],fa[y]已经是最远祖先了，所以直接将fa[x]的父亲连接起来就好 

int main()
{
	int i;
	scanf("%d%d", &n, &m);
	_rep(i, 1, n + 1) {
		cin >> pri[i];
	}
	build(n);
	_rep(i, 1, m + 1) {
		scanf("%d%d", &a, &b), mer(a, b);
	}
	_rep(i, 1, n + 1) {
		pri[find(i)] = min(pri[find(i)], pri[i]);
	}
	LL sn = 0;
	_rep(i, 1, n + 1) {
		if (i == find(i)) {
			sn += pri[i];
		}
	}
	cout << sn;
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~