uva 10779

最大流

//====================================================================||
// Name        : Collector's Problem.cpp                                              ||
// Date : 2013/7/22 上午1:41:23                                               ||
// Author : GCA                                                       ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 50
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
struct node{
    int to,c;
    node(){};
    node(int to,int c):to(to),c(c){};
};
int n,m;
vector<node> mz[100];
int ppl[100];
int opp[100][100];
int flow[100][100];
int pflow[100];
int father[100];
void solve(){

    Set(flow,0);
    int maxflow=0;
    while(1){
        Set(pflow,0);
        pflow[M]=oo;
        queue<int> q;
        q.push(M);
        while(!q.empty()){
            int f=q.front();q.pop();
            FOR(it,mz[f]){
                int to=(*it).to;
                int c=(*it).c;
                if(!pflow[to]&&flow[f][to]<c){
                    q.push(to);
                    pflow[to]=min(pflow[f],c-flow[f][to]);
                    father[to]=f;
                }
            }
        }
        if(!pflow[M+1])break;
        maxflow+=pflow[M+1];
        for(int i=M+1;i!=M;i=father[i]){
            flow[father[i]][i]+=pflow[M+1];
            flow[i][father[i]]-=pflow[M+1];
        }
    }
    printf("%d\n",maxflow);
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    int ff=0;
    while(test--){
        for(int i=0;i<100;i++){
            mz[i].clear();
        }
        scanf("%d%d",&n,&m);
        int tmp;
        Set(ppl,0);
        scanf("%d",&tmp);
        while(tmp--){
            int x;
            scanf("%d",&x);
            x--;
            ppl[x]++;
        }
        Set(opp,0);
        for(int i=1;i<n;i++){
            scanf("%d",&tmp);
            while(tmp--){
                int x;
                scanf("%d",&x);
                x--;
                opp[i][x]++;
            }
        }
        for(int i=0;i<m;i++){
            if(ppl[i]){
                mz[M].PB(node(i,ppl[i]));
                mz[i].PB(node(M,0));
            }

            mz[i].PB(node(M+1,1));
            mz[M+1].PB(node(i,0));
        }
        for(int i=1;i<n;i++){
            for(int j=0;j<m;j++){
                if(opp[i][j]==0){
                    mz[j].PB(node(i+m,1));
                    mz[i+m].PB(node(j,0));
                }
                if(opp[i][j]>=1){
                    mz[i+m].PB(node(j,opp[i][j]-1));
                    mz[j].PB(node(i+m,0));
                }
            }
        }
        printf("Case #%d: ",++ff);
        solve();

    }

















}