hdu 2119 Matrix（二分最大匹配）

最新推荐文章于 2021-09-09 19:20:22 发布

清风--旋叶

最新推荐文章于 2021-09-09 19:20:22 发布

阅读量678

点赞数

分类专栏：二分匹配

本文链接：https://blog.csdn.net/lyf2934463735/article/details/38828125

版权

二分匹配专栏收录该内容

14 篇文章 0 订阅

订阅专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2119

Problem Description

Give you a matrix(only contains 0 or 1),every time you can select a row or a column and delete all the '1' in this row or this column .

Your task is to give out the minimum times of deleting all the '1' in the matrix.

Input

There are several test cases.

The first line contains two integers n,m(1<=n,m<=100), n is the number of rows of the given matrix and m is the number of columns of the given matrix.
The next n lines describe the matrix:each line contains m integer, which may be either ‘1’ or ‘0’.

n=0 indicate the end of input.

Output

For each of the test cases, in the order given in the input, print one line containing the minimum times of deleting all the '1' in the matrix.

Sample Input

Sample Output

Author

Wendell

Source

HDU 2007-10 Programming Contest_WarmUp

题意，给你一个0、1矩阵，每次可以消去一行或者一列的1，问最少的次数消去所有的1。以行和列为左右集，建二分图，然后求二分最大匹配。

代码：

#include<stdio.h>
#include<string.h>
const int maxn=110;
int mp[maxn][maxn];
int vis[maxn];
int nx,ny,cx[maxn],cy[maxn];
int n,m;
int find(int u)
{
    for(int i=1;i<=ny;i++)
    {
        if(mp[u][i]&&!vis[i])
        {
            vis[i]=1;
            if(cy[i]==-1||find(cy[i]))
            {
                cy[i]=u;
                cx[u]=i;
                return 1;
            }
        }
    }
    return 0;
}
void match()
{
    int res=0;
    memset(cy,-1,sizeof(cy));
    memset(cx,-1,sizeof(cx));
    for(int i=1;i<=nx;i++)
    {
        if(cx[i]==-1)
        {
            memset(vis,0,sizeof(vis));
            res+=find(i);
        }
    }
    printf("%d\n",res);
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%d",&n)&&n)
    {
        scanf("%d",&m);
        memset(mp,0,sizeof(mp));
        nx=n;
        ny=m;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                int num;
                scanf("%d",&num);
                if(num)
                    mp[i][j]=1;
            }
        }
        match();
    }
    return 0;
}