hdoj4685

数据：

/*
99999
3 4
3 1 2 4
2 2 3
2 3 4
*/

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <cassert>
#include <stack>
#include <bitset>
#define mkp make_pair
using namespace std;
const double EPS=1e-;
typedef long long lon;
const lon SZ=,S=,T=,SSZ=*SZ,one=,INF=0x7FFFFFFF,mod=;
lon n,m,dfn[SSZ],low[SSZ],cnt,tot,bel[SSZ];
bool mp[SSZ][SSZ],ins[SSZ],mk[SSZ],sz[SSZ];
int src[SSZ][SSZ],dep[SSZ],num;
stack<lon> stk;
/*
99999
3 4
3 1 2 4
2 2 3
2 3 4
*/

bool bfs()
{
    memset(dep,,sizeof(dep));
    queue<int> q;
    q.push(S);
    dep[S]=;
    for(;q.size();)
    {
        int fr=q.front();
        q.pop();
        //cout<<fr<<endl;
        for(int i=;i<=T;++i)
        {
            if(src[fr][i]&&!dep[i])
            {
                dep[i]=dep[fr]+;
                q.push(i);
                if(i==T)return ;
            }
        }
    }
    return ;
}

int dinic(int x,int flow)
{
    if(x==T)return flow;
    else
    {
        int rem=flow;
        for(int i=;i<=T&&rem;++i)
        {
            if(src[x][i]&&dep[i]==dep[x]+)
            {
                int tmp=dinic(i,min(rem,src[x][i]));
                if(!tmp)dep[i]=;
                rem-=tmp;
                src[x][i]-=tmp;
                src[i][x]+=tmp;
            }
        }
        return flow-rem;
    }
}

void init()
{
    cin>>n>>m;
    for(lon i=;i<=n;++i)
    {
        src[S][i]=;
        lon knum;
        cin>>knum;
        for(lon j=;j<knum;++j)
        {
            lon id;
            cin>>id;
            mp[i][id+n]=;
            src[i][id+n]=;
        }
    }
    for(int i=;i<=m;++i)src[i+n][T]=;
    for(;bfs();)
    {
        dinic(S,INF);
    }
    num=n+m;
    for(lon i=;i<=n;++i)
    {
        int ok=;
        for(int j=;j<=m;++j)
        {
            //cout<<i<<" "<<j<<" "<<src[i][j+n]<<" "<<mp[i][j+n]<<endl;
            if(src[i][j+n]!=mp[i][j+n])
            {
                mp[j+n][i]=;
                ok=;
            }
        }
        if(!ok)
        {
            mk[i]=;//not used
            ++num;
            for(int j=;j<=n;++j)
            {
                mp[j][num]=;
            }
            mp[num][i]=;
        }
        //cout<<mk[i]<<endl;
    }
    for(int i=;i<=m;++i)
    {
        //cout<<src[i+n][T]<<endl;
        if(src[i+n][T]==)
        {
            sz[i]=;
            ++num;
            for(int j=;j<=m;++j)
            {
                mp[num][j+n]=;
            }
            mp[i+n][num]=;
        }
    }
}

void dfs(lon x)
{
    dfn[x]=low[x]=++cnt;
    stk.push(x);
    ins[x]=;
    for(lon i=;i<=num;++i)
    {
        if(mp[x][i])
        {
            if(!dfn[i])
            {
                dfs(i);
                low[x]=min(low[x],low[i]);
            }
            else if(ins[i])low[x]=min(low[x],low[i]);
        }
    }
    if(low[x]==dfn[x])
    {
        ++tot;
        for(;stk.size();)
        {
            lon top=stk.top();
            stk.pop();
            bel[top]=tot;
            ins[top]=;
            if(top==x)break;
        }
    }
}

void work()
{
    for(lon i=;i<=n+m;++i)if(!dfn[i])dfs(i);
    for(lon i=;i<=n;++i)
    {
        vector<lon> ans;
        //cout<<bel[i]<<" "<<bel[i+n]<<endl;
        for(lon j=;j<=m;++j)
        {
                //cout<<sz[j+n]<<endl;
            if(mp[i][j+n]&&bel[i]==bel[j+n])
            {
                ans.push_back(j);
            }
        }
        cout<<ans.size();
        sort(ans.begin(),ans.end());
        for(lon j=;j<ans.size();++j)
        {
            cout<<" "<<ans[j];
        }
        cout<<endl;
    }
    for(lon i=;i<=n;++i)
    {
        src[S][i]=;
        for(lon j=n+;j<=n+m;++j)mp[i][j]=mp[j][i]=src[i][j]=;
    }
    for(lon i=;i<=m;++i)
    {
        src[i+n][T]=;
    }
    memset(dfn,,sizeof(dfn));
    memset(low,,sizeof(low));
    memset(bel,,sizeof(bel));
    memset(mk,,sizeof(mk));
    memset(sz,,sizeof(sz));
    memset(ins,,sizeof(ins));
    memset(mp,,sizeof(mp));
    memset(src,,sizeof(src));
    for(;stk.size();stk.pop());
    cnt=tot=;
}

int main()
{
    std::ios::sync_with_stdio();
    //freopen("d:\\1.txt","r",stdin);
    lon casenum;
    cin>>casenum;
    //cout<<casenum<<endl;
    for(int time=;time<=casenum;++time)
    //for(lon time=1;cin>>n;++time)
    {
        //printf("Case #%d:\n",time);
        cout<<"Case #"<<time<<":"<<endl;
        init();
        work();
    }
    return ;
}