zoukankan      html  css  js  c++  java
  • Hdu 2119 Matrix

    Matrix

    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
     
    #include <cstdio>
    #include <cstring>
    using namespace std;
    int n,m,s,t,ans,w[2333][2333],a[1000000];
    bool vis[100000];
    
    inline void read(int &now)
    {
        char ch; ch=getchar(); now=0;
        while(ch>'9'||ch<'0') ch=getchar();
        while(ch>='0'&&ch<='9') now=now*10+ch-'0',ch=getchar();
    }
    
    int find(int x)
    {
        for(int i=1;i<=m;i++)
        {
            if(w[x][i]&&!vis[i])
            {
                vis[i]=true;
                if(!a[i]||find(a[i]))
                {
                    a[i]=x;
                    return 1;
                }
            }
        }
        return 0;
    }
    
    int main()
    {
        while(scanf("%d",&n)&&n)
        {
            if(!n) break ;
            scanf("%d",&m);
            for(int i=1;i<=n;i++)
                for(int j=1;j<=m;j++)
                    scanf("%d",&w[i][j]);
            for(int i=1;i<=n;i++)
            {
                memset(vis,false,sizeof(vis));
                if(find(i)) ans++;
            }
            printf("%d
    ",ans);
            memset(w,0,sizeof(w));
            memset(a,0,sizeof(a));
            ans=0;
        }
        return 0;
    }
  • 相关阅读:
    过滤器判断请求参数中是否含有某一字段
    vscode开发vue项目实现pc端自适应_cssrem_rem_reset.scss,pc端媒体查询常用设置
    element_ui的datePicker修改样式
    TCP/IP 卷一 APR、RAPR、ICMP
    TCP/IP 卷一:协议(IP层)
    常见负载均衡策略
    TCP/IP 卷一:协议(链路层)
    TCP/IP 卷一:协议(概述)
    RokcetMQ
    Zookeeper集群
  • 原文地址:https://www.cnblogs.com/chen74123/p/7436290.html
Copyright © 2011-2022 走看看