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 xi, yi and di.
There is a blank line before each test case.
1 ≤ N, M ≤ 10000
0 ≤ R ≤ 50,000
0 ≤ xi < N
0 ≤ yi < M
0 < di < 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
其实和最小生成树一样,只不过自定义的时候反转一下符号就好了,一直t的原因是因为在finds中,如果直接递归的话,要写成return x==fa[x]?fa[x]:fa[x]=finds(fa[x])之前fa[x]一直没写,就t了
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,t,T;
struct node
{
int fa;
int son;
int wei;
bool operator <(const node& a)const
{
return wei>a.wei;
}
}edge[50005];
int fa[20005];
int finds(int x)
{
return x==fa[x]?fa[x]:fa[t]=finds(fa[x]);
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&n,&m,&t);
long long ans=0;
for(int i=0;i<=n+m;i++)
fa[i]=i;
for(int i=1;i<=t;i++)
{
scanf("%d%d%d",&edge[i].fa,&edge[i].son,&edge[i].wei);
edge[i].son+=n;
}
sort(edge+1,edge+1+t);
for(int i=1;i<=t;i++)
{
int f=finds(edge[i].fa);
int s=finds(edge[i].son);
if(f!=s)
{
ans+=edge[i].wei;
fa[f]=s;
}
}
printf("%lld\n",1ll*(n+m)*10000-ans);
}
}