poj3723 kruskal最小生成树

最小生成树。
树的话就有从叶子到根节点，那么一棵树下来，不会有重边和圈，切，上面的给下面一个提供关系，这样生成的树一定能够满足题目要求。
题目求的是最小代价，但题目给的代价是d，要稍微转化一下。
我用的kruskal算法。其实也可以用prim算法，不过我总觉prim难写一些

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const long long INF = 0x3f3f3f3f;
using namespace std;
typedef pair<int, int> pir;
struct edge { int from, to, cost; };
edge grp[50002];
int sum = 0;
int pr[20005];
int ht[20002];
int t, n, m, r;
bool cmp(edge a, edge b)
{
 return a.cost < b.cost;
}
void init()
{
 up(i, 0, n + m)
 {
  pr[i] = i;
  ht[i] = 0;
 }
}
int find(int x)
{
 if (pr[x] == x)
  return x;
 else return pr[x] = find(pr[x]);
}
void unio(int x,int y)
{
 x = find(x);
 y = find(y);
 if (x == y)return;
 if (ht[x] < ht[y])
  pr[x] = y;
 else
 {
  pr[y] = x;
  if (ht[y] == ht[x])
   ht[x]++;
 }
}
bool same(int x, int y)
{
 if (find(x) == find(y))return true;
 else return false;
}
int kruskal()
{
 init();
 sort(grp, grp + r,cmp);
 int cost = 0;
 up(i, 0, r)
 {
  int b = grp[i].from;
  int g = grp[i].to;
  if (same(b, g))
   continue;
  unio(b, g);
  cost += grp[i].cost;
 }
 return cost;
}
int main()
{
 cin >> t;
 int boy, girl;
 while (t--)
 {
  cin >> n >> m >> r;
  up(i, 0, r)
  {
   //cin >>girl>> boy >> grp[i].cost;
   //girl += m;
   scanf("%d %d %d", &girl, &boy, &grp[i].cost);
   boy+=n;
   grp[i].from = boy;
   grp[i].to = girl;
   grp[i].cost *= -1;
  }
  sum = (10000)*(n + m);
  sum += kruskal();
  cout << sum << endl;
 }
 return 0;
}