最小生成树的模板,利用并差集
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXD 50000 + 100
int N,M,R;
int Sum;
struct Line{
int l;
int r;
int cost;
}line[MAXD];
bool cmp(Line p ,Line q){
if(p.cost < q.cost)
return true;
else
return false;
}
int fa[MAXD];
int find_father(int u){
return u == fa[u] ? u : fa[u] = find_father(fa[u]);
}
void solve(){
for(int i = 0; i < N + M ;i++) fa[i] = i;
for(int i = 0 ; i < R ; i++){
int l = line[i].l;
int r = line[i].r;
int x = find_father(l);
int y = find_father(r);
if(x != y){
fa[x] = y;
Sum += line[i].cost;
}
}
for(int i = 0; i < N + M ; i++){
int x = find_father(i);
if(i == x) Sum += 10000;
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
Sum = 0;
scanf("%d%d%d",&N,&M,&R);
for(int i = 0; i < R ; i++){
int x,y;
scanf("%d%d%d",&line[i].l,&x,&y);
line[i].r = x + N;
line[i].cost = 10000 - y;
}
sort(line,line + R,cmp);
solve();
printf("%d\n",Sum);
}
return 0;
}