hdu1068 Girls and Boys 匈牙利算法（邻接表）

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

const int maxn = 10008;
vector<int>map[maxn];
bool mark[maxn];
int link[maxn];
int n;

void init(){
    for (int i = 0; i <= n; i++){
        map[i].clear();
    }
    memset(mark, false, sizeof(mark));
    memset(link, -1, sizeof(link));
}

bool dfs(int x){
    int k = map[x].size();
    for (int j = 0; j < k; j++){
        int v = map[x][j];
        if (!mark[v]){
            mark[v] = true;
            if (link[v] == -1 || dfs(link[v])){
                link[v] = x;
                return true;
            }
        }
    }
    return false;
}

int main(){
    while (scanf("%d", &n) != EOF){
        init();
        for (int i = 0; i < n; i++){
            int x, y;
            scanf("%d: (%d)", &x, &y);
            for (int j = 0; j < y; j++){
                scanf("%d", &x);
                map[i].push_back(x);
            }
        }

        int ans = 0;
        for (int i = 0; i < n; i++){
            memset(mark, false, sizeof(mark));
            if (dfs(i))
                ans++;
        }
        printf("%d
", n - ans / 2);
    }
    //system("pause");
    return 0;
}