POJ 1274 The Perfect Stall（二分图最大匹配）

int n,m;
vector<int> graph[205];
int cx[205],cy[205];
bool bmask[205];

int findPath(int u){
    int L=graph[u].size();
    rep(i,0,L-1){
        int v=graph[u][i];
        if(!bmask[v]){
            bmask[v]=true;
            if(cy[v]==-1||findPath(cy[v])){
                cy[v]=u;
                cx[u]=v;
                return 1;
            }
        }
    }
    return 0;
}
int MaxMatch(){
    int ans=0;
    rep(i,1,n) cx[i]=-1;
    rep(i,1,m) cy[i]=-1;
    rep(i,1,n) if(cx[i]==-1){
        mem(bmask,false);
        ans+=findPath(i);
    }
    return ans;
}
int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        rep(i,1,n) graph[i].clear();
        rep(i,1,n){
            int x,tx;
            scanf("%d",&x);
            while(x--){
                scanf("%d",&tx);
                graph[i].push_back(tx);
            }
        }
        int dd=MaxMatch();
        printf("%d\n",dd);
    }
}