Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11386 | Accepted: 4020 |
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
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
Source
POJ Monthly Contest – 2009.04.05, windy7926778
题意:需要征募女兵N人,男兵M人,每征一个人需要10000元,但是如果在已经征募到的人中有一些关系亲密的人,那么可以少花一点钱.给出若干男女间的亲密度关系,
征募的费用是10000-已被征募的人中和自己亲密度的最大值,要求征募总费用最小
题解:男女间的亲密度看成一条边,把每条边权值变成相反数,从小到大排序,将它们构成最小生成树的森林(因为每个人值需要取亲密度最大的边,因此一定不会构成环)
将树的权值全部加起来再加上(n+m)*10000就是答案
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<string.h>
using namespace std;
const int maxn = 50000 + 5;
struct Edge{
int x,y,cost;
bool operator<(const Edge& _A)const{
return cost<_A.cost;
}
}edge[maxn];
int p[maxn];
int find(int x){return p[x]==x?x:(p[x]=find(p[x]));}
int main(){
int T;
scanf("%d",&T);
while(T--){
int n,m,k;
scanf("%d%d%d",&n,&m,&k);
for(int i=0;i<=n+m;i++) p[i]=i;
for(int i=0;i<k;i++){
scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].cost);
edge[i].y+=n;
edge[i].cost=-edge[i].cost;
}
sort(edge,edge+k);
int cost=0;
for(int i=0;i<k;i++){
int p1=find(edge[i].x),p2=find(edge[i].y);
if(p1!=p2){
cost+=edge[i].cost;
p[p2]=p1;
}
}
printf("%d\n",(n+m)*10000+cost);
}
return 0;
}