首页 > 代码库 > (匈牙利算法) hdu 2119
(匈牙利算法) hdu 2119
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<algorithm>#include<cstdlib>using namespace std;int n,m,a[110][110],g[110][110],mark[110],link[110],ans;bool dfs(int t){ for(int i=0;i<m;i++) { if(mark[i]==-1&&g[t][i]) { mark[i]=1; if(link[i]==-1||dfs(link[i])) { link[i]=t; return true; } } } return false;}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { if(n==0) break; memset(link,-1,sizeof(link)); memset(g,0,sizeof(g)); ans=0; for(int i=0;i<n;i++) for(int j=0;j<m;j++) scanf("%d",&g[i][j]); for(int i=0;i<n;i++) { memset(mark,-1,sizeof(mark)); if(dfs(i)) ans++; } printf("%d\n",ans); }}
Matrix
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2076 Accepted Submission(s): 911
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.
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.
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 01 0 10 1 00
Sample Output
2
Author
Wendell
Source
HDU 2007-10 Programming Contest_WarmUp
(匈牙利算法) hdu 2119
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。