POJ 3723 Conscription

Description

Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege, he must pay 10000 RMB. There are some relationships between girls and boys and Windy can use these relationships to reduce his cost. If girl x and boy y have a relationship d and one of them has been collected, Windy can collect the other one with 10000-d RMB. Now given all the relationships between girls and boys, your assignment is to find the least amount of money Windy has to pay. Notice that only one relationship can be used when collecting one soldier.

Input

The first line of input is the number of test case.
The first line of each test case contains three integers, N, M and R.
Then R lines followed, each contains three integers x_i, y_i and d_i.
There is a blank line before each test case.

1 ≤ N, M ≤ 10000
0 ≤ R ≤ 50,000
0 ≤ x_i < N
0 ≤ y_i < M
0 < d_i < 10000

Output

For each test case output the answer in a single line.

Sample Input

2

5 5 8
4 3 6831
1 3 4583
0 0 6592
0 1 3063
3 3 4975
1 3 2049
4 2 2104
2 2 781

5 5 10
2 4 9820
3 2 6236
3 1 8864
2 4 8326
2 0 5156
2 0 1463
4 1 2439
0 4 4373
3 4 8889
2 4 3133

Sample Output

71071
54223

题意：要征兵n个男兵和m个女兵，每个花费10000元，
但是如果已经征募的男士兵中有和将要征募的女士兵关系好的，
那么可以减少花费，给出关系，求最小花费。
每个人只能用一种关系


求一棵最大生成树 然后减掉
在处理时要把女士兵编号+n 方便后面操作 
把女士兵编号+n后 画一画 
其实输入的就是一个图 在其中求一棵最大生成树

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#define pi acos(-1)
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
typedef pair<int, int> P;
const int maxn = 1e5 + 5;

struct Node
{
	int a, b, w;
}edge[maxn]; 
int ret[maxn];
int cmp(Node a, Node b)
{
	if (a.w > b.w) return 1;
	return 0;
}
int find(int a)
{
	if (ret[a] == -1) return a;
	return ret[a] = find(ret[a]);
}
int main(void)
{
//	freopen("C:\\Users\\wave\\Desktop\\NULL.exe\\NULL\\in.txt","r", stdin);
	int T, i, j, k, n, m, r, sum;
	cin >> T;
	while (T--)
	{
		cin >> n >> m >> r;
		for (i = 1; i <= r; i++){
			scanf("%d %d %d", &edge[i].a, &edge[i].b, &edge[i].w);
			edge[i].b += n;
		}
		memset(ret, -1, sizeof(ret));
		sort(edge+1, edge+1+r, cmp);
		sum = 0;
		for (i = 1; i <= r; i++){
			int x = find(edge[i].a);
			int y = find(edge[i].b);
			if (x == y) continue;
			ret[x] = y;
			sum += edge[i].w;
		}
		printf("%d\n", 10000*(n+m) - sum);
	}

	return 0;
}