匈牙利算法

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<ctime>
using namespace std;
const int N=205;
bool gra[N][N],state[N];
int result[N],ans,n,m,s,x;
bool find(int a){
    for(int i=1;i<=m;i++){
        if(gra[a][i]&&!state[i]){
            state[i]=1;
            if(!result[i]||find(result[i])){
                result[i]=a;
                return true;
            }
        }
    }
    return false;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&s);
        for(int j=1;j<=s;j++){
            scanf("%d",&x);
            gra[i][x]=1;
        }
    }
    for(int i=1;i<=n;i++){
        memset(state,0,sizeof(state));
        if(find(i)){
            ans++;
        }
    }
    printf("%d",ans);
    return 0;
}