hdu2119—Matrix(最小点覆盖)
来源:互联网 发布:c#第三版编程题及答案 编辑:程序博客网 时间:2024/05/16 04:44
题目链接:传送门
Matrix
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3012 Accepted Submission(s): 1368
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
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <string>#include <stack>#include <queue>using namespace std;typedef long long ll;const int N = 10900;const int M = 109;const int INF = 0x3fffffff;const double eps = 1e-8;const double PI = acos(-1.0);struct Edge{ int node; Edge*next;}m_edge[N];int girl[M];Edge*head[M];int Flag[M],Ecnt,cnt;void init(){ Ecnt = cnt = 0; fill( girl , girl+M , 0 ); fill( head , head+M , (Edge*)0 );}//b对g有好感void mkEdge( int b , int g ){ m_edge[Ecnt].node = g; m_edge[Ecnt].next = head[b]; head[b] = m_edge+Ecnt++;}bool find( int x ){ for( Edge*p = head[x] ; p ; p = p->next ){ int s = p->node; //有好感的女生 if( !Flag[s] ){ Flag[s] = true; //该女生在本轮匹配中被访问 if( girl[s] == 0 || find(girl[s]) ){ //女生没有对象或者另外一个男生能把这个妹纸让给x男 girl[s] = x; return true; } } } return false;}//构建二分图void Build( int n , int m ){ int r; for( int i = 1 ; i <= n ; ++i ){ for( int j = 1 ; j <= m ; ++j ){ scanf("%d",&r); if( r == 1 ) mkEdge(i,j); } }}void solve( int n ){ for( int i = 1 ; i <= n ; ++i ){ fill( Flag , Flag+M , 0 ); if( find(i) ) ++cnt; }}int main(){ int n,m; while( ~scanf("%d",&n)&&n ){ scanf("%d",&m); init(); Build(n,m); solve(n); printf("%d\n",cnt); } return 0;}
阅读全文
0 0
- hdu2119—Matrix(最小点覆盖)
- HDU2119 Matrix 【最小点覆盖】
- hdu2119 Matrix (最小顶点覆盖)
- 最小点集覆盖/HDU2119
- hdu2119(二分图+最小点覆盖+匈牙利算法)
- hdoj--2119--Matrix(最小点覆盖)
- hdu2119 Matrix
- HDU2119-Matrix
- Matrix hdu 2119 最小点覆盖
- HDU 2119 Matrix 最小点覆盖
- poj3041—Asteroids(最小点覆盖)
- HDU 2119 Matrix【二分图之最小点集覆盖】
- hdu 2119 Matrix 二分图 最小点覆盖
- HDU 2119 Matrix 二分图最小点覆盖
- hdu 2119 Matrix【最小点覆盖-二分匹配】
- hdoj1150(最小点覆盖)
- hdu 2119 Matrix (最小覆盖)
- 二分匹配 HDU2119 Matrix
- 网络基础 — 浅析TCP协议中的3次握手和4次挥手
- 饼状图
- Kindle fo PC 提示已超过授权限制
- ST Visual Programmer批量烧写教程
- SEO优化实录
- hdu2119—Matrix(最小点覆盖)
- Android动画——Android动画常用API
- 列表
- 游戏开发中的人工智能(七):A* 路径寻找算法
- windows下php线程安全与非线程安全的版本选择
- 浅谈MVC、MVP、MVVM架构模式的区别和联系
- thinkphp5 通过url数组array 带参数传输
- Java内存简要分析
- Mac使用AndroidStudio导入项目遇到的gradle syns failed的问题