POJ3723 Conscription 解题报告【Kruskal/最大生成树】

最新推荐文章于 2020-07-22 14:41:25 发布

theljt

最新推荐文章于 2020-07-22 14:41:25 发布

阅读量278

点赞数

分类专栏：单个题解文章标签： poj 最小生成树c++ 最小生成树并查集实现算法

本文链接：https://blog.csdn.net/theljt/article/details/78218662

版权

单个题解专栏收录该内容

141 篇文章 0 订阅

订阅专栏

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
解题报告
题意：需要n个男兵和m个女兵，每人入伍要10000元，如果一个女兵/男兵与部队里一个男兵/女兵有关系，那么就可以省d元的入伍费用。
那么很显然，我们把省下来的这d元钱当做边权建单向边，跑一边最大生成树，输出(n+m)*10000-ans就可以了。
此外还要注意，v节点（女兵）的编号要多n。
代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=10000,R=50000;
struct edge
{
    int u,v,w;
}ed[R+5];
int T,n,m,r,num;
int father[2*N+5];
bool cmp(edge a,edge b){return a.w>b.w;}
int find(int a){return father[a]==a?a:father[a]=find(father[a]);}
int kruskal()
{
    int tot=0,ans=0;
    for(int i=0;i<=n+m;i++)father[i]=i;
    sort(ed+1,ed+1+r,cmp);
    for(int i=1;i<=r;i++)
    {
        int u=ed[i].u,v=ed[i].v;
        u=find(u),v=find(v+n);
        if(u==v)continue;
        father[v]=u;
        ans+=ed[i].w;
        if(++tot==(n+m-1))break;
    }
    return ans;
}
int main()
{
    for(scanf("%d",&T);T;T--)
    {
        scanf("%d%d%d",&n,&m,&r);
        for(int i=1;i<=r;i++)scanf("%d%d%d",&ed[i].u,&ed[i].v,&ed[i].w);
        printf("%d\n",(n+m)*10000-kruskal());
    }
    return 0;
}