二分图的多重匹配

来自：http://www.cppblog.com/JulyRina/archive/2015/02/13/209816.html
参控：http://www.cnblogs.com/nanke/archive/2012/04/15/2450288.html
//HDU3605
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int maxn = 100010;
const int maxm = 11;
int y_match[maxn][maxm] ;
int g[maxn][maxm], cnt[maxm], capacity[maxn], n, m;
bool vis[maxm];

bool dfs(int x) {
    for(int i=0;i<m;i++) {
        if(g[x][i] == 0 || vis[i] == true) continue;
        vis[i] = true;
        if(cnt[i] < capacity[i]) {
            y_match[x][cnt[i]++] = x;
            return true;
        } else {
            for(int j=0;j<capacity[i];j++) {
                if(dfs(y_match[i][j]) == true) {
                    y_match[i][j] = x;
                    return true;
                }
            }
        }
    }
    return false;
}
bool hungary(int n) {
    for(int i=0;i<n;i++) {
        memset(vis, false, sizeof(bool)*(m));
        if(dfs(i) == false)
            return false;
    }
    return true;
}
int main() {
    while(~scanf("%d%d" , &n, &m)) {
        memset(cnt, 0, sizeof(int)*(n));
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                scanf("%d", &g[i][j]);
        for(int i=0;i<m;i++)
            scanf("%d", &capacity[i]);
        if(hungary(n) == true)
            puts("YES");
        else
            puts("NO");
    }
    return 0;
}