按照权值从大到小用Kruscal建立最大生成树
AC代码:
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <fstream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define maxn 1010
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,a,b) for(int i=(a);i<=(b);i++)
#define PI pair<int,int>
//#define mp make_pair
#define FI first
#define SE second
#define IT iterator
#define PB push_back
#define Times 10
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int ,int > P;
//#define N 100
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = (ll)1e18+300;
const int maxd = 51000 + 10;
int n, m;
int fa[maxd];
int depth[maxd];
struct node{
int x, y;
int val;
};
node ac[maxd];
bool cmp(node a, node b) {
return a.val > b.val;
}
void init() {
for (int i = 0; i <= n; i++){
fa[i] = i;
depth[i] = 1;
}
}
int find(int x) {
if(x != fa[x]) {
fa[x] = find(fa[x]);
}
return fa[x];
}
bool same(int x, int y) {
if(find(x) == find(y)) {
return true;
}
return false;
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if(x == y) {
return;
}
if(depth[x] < depth[y]) {
fa[x] = y;
}
else{
fa[y] =x;
if(depth[x] == depth[y]) {
depth[x]++;
}
}
}
int main() {
scanf("%d%d", &n, &m);
init();
for (int i = 0; i < m; i++) {
int a, b;
int val;
scanf("%d%d%d", &ac[i].x, &ac[i].y, &ac[i].val);
}
sort(ac, ac + m, cmp);
// int vis[1010];
// ms(vis, 0);
int res =1;
int ans = 0;
for (int i = 0; res <= n && i < m; i++) {
int x = ac[i].x;
int y = ac[i].y;
int val = ac[i].val;
if(!same(x, y)) {
// vis[x] = 1;
// vis[y] = 1;
res ++;
unite(x, y);
ans += val;
}
}
// int flag = 0;
// for (int i = 1; i <= n; i++) {
// if(!vis[i]) {
// flag= 1;
// break;
// }
// }
if(res < n) {
cout << "-1" << endl;
}
else
cout << ans << endl;
}