hdu 2119 Matrix【最小点覆盖-二分匹配】

Matrix

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2474    Accepted Submission(s): 1107

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

3 3

0 0 0

1 0 1

0 1 0

0

Sample Output

2

Author

Wendell

 

题目大意：给你一个n*m的图，每一次可以选择一行或者一列元素进行删除，问最少需要选取几次，能将图中所有的1都删除。 

思路：

经典的最小点覆盖问题，最小点覆盖==最大二分匹配数。

我们将行列都看成图论中的点，行列进行匹配即可。

AC代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int a[105][105];
int match[105];
int vis[105];
int n,m;
int find(int x)
{
    for(int i=0;i<m;i++)
    {
        if(a[x][i]==1&&vis[i]==0)
        {
            vis[i]=1;
            if(match[i]==-1||find(match[i]))
            {
                match[i]=x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    while(~scanf("%d",&n))
    {
        if(n==0)break;
        scanf("%d",&m);
        memset(match,-1,sizeof(match));
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        int output=0;
        for(int i=0;i<n;i++)
        {
            memset(vis,0,sizeof(vis));
            if(find(i))output++;
        }
        printf("%d\n",output);
    }
}