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 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
Solution
还是小白书的题,照着紫书写的
学习写并查集的一道题
初始化10005改20005过了,我TM……该配眼镜了
AC代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,r;
int father[50005];
struct edge
{
int from,to,cost;
}f[50005];
bool rule(edge x,edge y)
{
return x.cost<y.cost;
}
int find(int x)
{
if(father[x]==x) return x;
else return father[x]=find(father[x]);
}
long long kruskal()
{
long long ans=0;
for(int i=0;i<20005;++i)
{
father[i]=i;
}
sort(f+1,f+1+r,rule);
for(int i=1;i<=r;++i)
{
edge e=f[i];
int x=find(e.from);
int y=find(e.to);
if(x!=y)
{
ans=ans+e.cost;
father[x]=y;
}
}
return ans;
}
int main()
{
int t;
scanf("%d",&t);
for(int k=1;k<=t;++k)
{
getchar();
scanf("%d %d %d",&n,&m,&r);
for(int i=1;i<=r;++i)
{
int x,y,d;
scanf("%d %d %d",&x,&y,&d);
f[i].from=x;
f[i].to=n+y;
f[i].cost=-d;
}
printf("%lld\n",10000*(n+m)+kruskal());
}
}