匈牙利算法模板-二分图最大匹配问题

传送门:题目连接

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<stack>
#define eps 1e-7
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define say printf
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>P;
const int MAX_V = 4e2+5;
vector<int> G[MAX_V];
int match[MAX_V];
bool used[MAX_V];
int N,M,V;  //V 是M+N    电脑数和任务数之和     
void add_edge(int u,int v){
    G[u].push_back(v);
    G[v].push_back(u);
}
bool dfs(int v){
    used[v] = true;
    for(int i=0;i<G[v].size();i++){
        int u = G[v][i],w=match[u];
        if(w<0 || !used[w]&&dfs(w)){
            match[v] = u;
            match[u] = v;
            return true;
        }
    }
    return false;
}
int bipartite_matching(){
    int res = 0;
    memset(match,-1,sizeof(match));
    for(int v= 0;v<V;v++){
        if(match[v]<0){
            memset(used,0,sizeof(used));
            if(dfs(v)){
                res++;
            }
        }
    }
    return res;
}
int main(){
    while(~scanf("%d %d",&N,&M)){
        V = N + M;
        for(int i=0;i<V;i++)G[i].clear();   //注意清空链表
        for(int i=0;i<N;i++){
            int si;
            scanf("%d",&si);
            for(int j=0;j<si;j++){
                int temp;
                scanf("%d",&temp);
                int u = i,v = N+temp-1;
                add_edge(u,v);
            }
        }
        int ans = bipartite_matching();
        printf("%d\n",ans);
    }
    return 0;
}