zoukankan      html  css  js  c++  java
  • HDU3605 Escape —— 二分图多重匹配

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


    Escape

    Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 10349    Accepted Submission(s): 2476

    Problem Description
    2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the planet. Now scientists want your help, is to determine what all of people can live in these planets.
     
    Input
    More set of test data, the beginning of each data is n (1 <= n <= 100000), m (1 <= m <= 10) n indicate there n people on the earth, m representatives m planet, planet and people labels are from 0. Here are n lines, each line represents a suitable living conditions of people, each row has m digits, the ith digits is 1, said that a person is fit to live in the ith-planet, or is 0 for this person is not suitable for living in the ith planet.
    The last line has m digits, the ith digit ai indicates the ith planet can contain ai people most..
    0 <= ai <= 100000
     
    Output
    Determine whether all people can live up to these stars
    If you can output YES, otherwise output NO.
     
    Sample Input
    1 1 1 1 2 2 1 0 1 0 1 1
     
    Sample Output
    YES NO


    题解:

    二分图多重匹配的裸题,但要适当修改以防止超时。



    代码如下:

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 #include <vector>
     6 #include <cmath>
     7 #include <queue>
     8 #include <stack>
     9 #include <map>
    10 #include <string>
    11 #include <set>
    12 #define ms(a,b) memset((a),(b),sizeof((a)))
    13 //#define LOCAL
    14 using namespace std;
    15 typedef long long LL;
    16 const int INF = 2e9;
    17 const LL LNF = 9e18;
    18 const int mod = 1e9+7;
    19 const int maxn = 1e5+10;
    20 
    21 int n, m;
    22 int linker[20][maxn];
    23 int g[maxn][20];
    24 bool used[20];
    25 int num[20];
    26 
    27 bool dfs(int u)
    28 {
    29     for(int v = 1; v<=m; v++)
    30     if(g[u][v] && !used[v])
    31     {
    32         used[v] = true;
    33         if(linker[v][0] < num[v])
    34         {
    35             linker[v][++linker[v][0]] = u;
    36             return true;
    37         }
    38         for(int i = 1; i<=num[v]; i++)
    39         if(dfs(linker[v][i]))
    40         {
    41             linker[v][i] = u;
    42             return true;
    43         }
    44     }
    45     return false;
    46 }
    47 
    48 bool hungary()
    49 {
    50     for(int v = 1; v<=m; v++)
    51         linker[v][0] = 0;
    52     for(int u = 1; u<=n; u++)
    53     {
    54         memset(used,0,sizeof(used));
    55         if(!dfs(u)) return false; //如果这个人匹配不到,则直接退出。否则会超时。
    56     }
    57     return true;
    58 }
    59 
    60 int main()
    61 {
    62 #ifdef LOCAL
    63     freopen("123", "r", stdin);
    64 //      freopen("output.txt", "w", stdout);
    65 #endif
    66 
    67     while(scanf("%d%d",&n,&m)!=EOF)
    68     {
    69         for(int i = 1; i<=n; i++)
    70         for(int j = 1; j<=m; j++)
    71             scanf("%d",&g[i][j]);
    72         for(int i = 1; i<=m; i++)
    73             scanf("%d",&num[i]);
    74 
    75         if(hungary()) puts("YES");
    76         else puts("NO");
    77     }
    78 }
    View Code
  • 相关阅读:
    优先队列插入、删除
    堆排序
    UVALive 2474 Balloons in a Box(枚举)
    二叉树的建立、四种遍历、求深度、求叶子结点数
    说说尾递归(转载)
    1#Two Sum(qsort用法)
    马克思:青年在选择职业时的考虑
    最要紧的是,我们首先要善良,其次是要诚实,再次是以后永远不要相互遗忘。
    多重背包优化算法
    poj2976 Dropping tests(01分数规划 好题)
  • 原文地址:https://www.cnblogs.com/DOLFAMINGO/p/7538640.html
Copyright © 2011-2022 走看看