联络员
思路:最小生成树,不过需要按照p=1和w尽量小排序,先选p=1的,注意因为p=1的是必选,所以即使前边两个点已经联通仍要选这条路
具体代码如下
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 2010, M = 10010;
struct Node{
int p, a, b, w;
}node[M];
int n, m;
int p[N];
bool cmp(Node a, Node b){
if(a.p != b.p) return a.p < b.p;
return a.w < b.w;
}
int find(int x){
if(p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main(){
scanf("%d%d", &n, &m);
for(int i=1; i<=n; ++i) p[i] = i;
for(int i=0; i<m; ++i){
int p, a, b, w;
scanf("%d%d%d%d", &p, &a, &b, &w);
node[i] = {p, a, b, w};
}
sort(node, node + m, cmp);
int res = 0;
for(int i=0; i<m; ++i){
int a = node[i].a, b = node[i].b, w = node[i].w;
a = find(a), b = find(b);
if(a != b){
p[a] = b;
res += w;
}else if(node[i].p == 1) res += w;
}
printf("%d\n", res);
return 0;
}