Conscription（最大生成树）

最新推荐文章于 2023-02-08 23:18:37 发布

xiaoxiede_wo

最新推荐文章于 2023-02-08 23:18:37 发布

阅读量225

点赞数

分类专栏：最小生成树

本文链接：https://blog.csdn.net/xiaoxiede_wo/article/details/79858487

版权

最小生成树专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Windy需要组建军队，为此他选择了N个女孩和M个男孩。每个士兵的征集成本为10000 RMB，但如果女孩x和男孩y有关系d，他们中的一人被选中后，另一人的征集成本会减少到10000-d RMB。任务是找到征集所有士兵的最低总成本。这个问题可以转化为求解最大优惠的最小生成树问题。

摘要由CSDN通过智能技术生成

poj3723

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 15731		Accepted: 5437

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

Sample Output

71071
54223

n个女生，m个男生，r对认识的男女。每个进部队的人要交10000元，如果某对男女认识的话，且其中有一位一进部队，则另一位可以减x的费用，一个人只能拉进来一个关系户。

进去一个人就找与当前这个森林优惠最大的点，最小生成树一个道理，这是每次找与树最远的点。（这道题并不是每个点都能入树）。用（n+m）*10000-ans（最大优惠）

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define maxn 50005
struct node
{
    int x;
    int y;
    int value;
}edge[50005];
int f[maxn];
bool cmp(node a,node b)
{
    return a.value>b.value;
}
int found(int x)
{//路径压缩，否则超时
    if(x!=f[x])
        f[x]=found(f[x]);
    return f[x];
}
bool combine(int x,int y)
{
    int tx=found(x);
    int ty=found(y);
    if(tx==ty) return false;
     f[tx]=ty; return true;
}
int main()
{
    int t,n,m,r;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&r);
        ///共n个女生，m个男生，r个关系
         int num=0;
         int sum=0;
         memset(f,0,sizeof(f));
         memset(edge,0,sizeof(edge));
        for(int i=0;i<r;i++)
        {
            int b;
            scanf("%d%d%d",&edge[i].x,&b,&edge[i].value);
            edge[i].y=b+n;//bian hao
        }
        for(int i=0;i<=m+n-1;i++)
            f[i]=i;
        sort(edge,edge+r,cmp);
        for(int i=0;i<r;i++)
        {
//          if(num==n+m-1) break;并不是所有点都可以连进去，所以不用判断这个
            if(combine(edge[i].x,edge[i].y))
            {
                num++;
                sum+=edge[i].value;
            }
        }
            printf("%d\n",(n+m)*10000-sum);
    }
}