POJ 1274 The Perfect Stall【二分图最大匹配】

题意：二分图最大匹配

分析：二分图最大匹配

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int maxn = 205;
int n;

int Link[maxn];
int vis[maxn];
vector<int> G[maxn];
bool Find(int u) {
    for(int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if(!vis[v]) {
            vis[v] = 1;
            if(Link[v] == -1 || Find(Link[v])) {
                Link[v] = u;
                return true;
            }
        }
    }
    return false;
}

int solve() {
    int cnt = 0;
    memset(Link, -1, sizeof(Link));
    for(int i = 1; i <= n; i++) {
        if(G[i].size()) {
            memset(vis, 0, sizeof(vis));
            if(Find(i)) cnt++;
        }
    }
    return cnt;
}

int main() {
    int m;
    int num,_num;
    while(EOF != scanf("%d %d",&n, &m)) {
        for(int i = 1; i <= n; i++) {
            G[i].clear();
            scanf("%d",&num);
            for(int j = 0; j < num; j++) {
                scanf("%d",&_num);
                G[i].push_back(_num);
            }
        }
        printf("%d
",solve());
    }
    return 0;
}