Problem Description

There are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love.
For all princes,give all the princesses that they love. So, there is a maximum number of pairs of prince and princess that can marry.
Now for each prince, your task is to output all the princesses he can marry. Of course if a prince wants to marry one of those princesses,the maximum number of marriage pairs of the rest princes and princesses cannot change.

 

Input

The first line of the input contains an integer T(T<=25) which means the number of test cases.
For each test case, the first line contains two integers n and m (1<=n,m<=500), means the number of prince and princess.
Then n lines for each prince contain the list of the princess he loves. Each line starts with a integer k_i(0<=k_i<=m), and then k_i different integers, ranging from 1 to m denoting the princesses.

 

Output

For each test case, first output "Case #x:" in a line, where x indicates the case number between 1 and T.
Then output n lines. For each prince, first print li, the number of different princess he can marry so that the rest princes and princesses can still get the maximum marriage number.
After that print li different integers denoting those princesses,in ascending order.

 

Sample Input

 

Sample Output

 

Source

 

Recommend

zhuyuanchen520

 

 /* ***********************************************

 Author        :kuangbin

 Created Time  :2013/8/15 23:20:43

 File Name     :F:\2013ACM练习\2013多校8\1010.cpp

 ************************************************ */

 #include <stdio.h>

 #include <string.h>

 #include <iostream>

 #include <algorithm>

 #include <vector>

 #include <queue>

 #include <set>

 #include <map>

 #include <string>

 #include <math.h>

 #include <stdlib.h>

 #include <time.h>

 using namespace std;

 const int MAXN = ;

 int uN,vN;

 int g[MAXN][MAXN];

 int linker[MAXN];

 bool used[MAXN];

 bool dfs(int u)

 {

     for(int v = ; v <= vN;v++)

         if(g[u][v] && !used[v])

         {

             used[v] = true;

             if(linker[v] == - || dfs(linker[v]))

             {

                 linker[v] = u;

                 return true;

             }

         }

     return false;

 }

 int hungary()

 {

     int res = ;

     memset(linker,-,sizeof(linker));

     for(int u = ; u <= uN;u++)

     {

         memset(used,false,sizeof(used));

         if(dfs(u))res++;

     }

     return res;

 }

 int lx[MAXN];

 const int MAXM = ;//边数

 struct Edge

 {

     int to,next;

 }edge[MAXM];

 int head[MAXN],tot;

 int Low[MAXN],DFN[MAXN],Stack[MAXN],Belong[MAXN];//Belong数组的值是1~scc

 int Index,top;

 int scc;//强连通分量的个数

 bool Instack[MAXN];

 int num[MAXN];//各个强连通分量包含点的个数，数组编号1~scc

 //num数组不一定需要，结合实际情况

 void addedge(int u,int v)

 {

     edge[tot].to = v;edge[tot].next = head[u];head[u] = tot++;

 }

 void Tarjan(int u)

 {

     int v;

     Low[u] = DFN[u] = ++Index;

     Stack[top++] = u;

     Instack[u] = true;

     for(int i = head[u];i != -;i = edge[i].next)

     {

         v = edge[i].to;

         if( !DFN[v] )

         {

             Tarjan(v);

             if( Low[u] > Low[v] )Low[u] = Low[v];

         }

         else if(Instack[v] && Low[u] > DFN[v])

             Low[u] = DFN[v];

     }

     if(Low[u] == DFN[u])

     {

         scc++;

         do

         {

             v = Stack[--top];

             Instack[v] = false;

             Belong[v] = scc;

             num[scc]++;

         }

         while( v != u);

     }

 }

 void solve(int N)

 {

     memset(DFN,,sizeof(DFN));

     memset(Instack,false,sizeof(Instack));

     memset(num,,sizeof(num));

     Index = scc = top = ;

     for(int i = ;i <= N;i++)

         if(!DFN[i])

             Tarjan(i);

 }

 void init()

 {

     tot = ;

     memset(head,-,sizeof(head));

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     //freopen("out.txt","w",stdout);

     int n,m;

     int k;

     int T;

     scanf("%d",&T);

     int iCase = ;

     while(T--)

     {

         iCase++;

         scanf("%d%d",&n,&m);

         memset(g,,sizeof(g));

         int v;

         for(int i = ;i <= n;i++)

         {

             scanf("%d",&k);

             while(k--)

             {

                 scanf("%d",&v);

                 g[i][v] = ;

             }

         }

         uN = n;

         vN = m;

         int res = hungary();

         uN = vN = n + m - res;

         for(int i = n+;i <= uN;i++)

             for(int j = ;j <= vN;j++)

                 g[i][j] = ;

         for(int i = ;i <= uN;i++)

             for(int j = m+;j <= vN;j++)

                 g[i][j] = ;

         hungary();

         memset(lx,-,sizeof(lx));

         for(int i = ;i <= vN;i++)

             if(linker[i] != -)

                 lx[linker[i]] = i;

         init();

         for(int i = ;i <= uN;i++)

             for(int j = ;j <= vN;j++)

                 if(g[i][j] && j != lx[i])

                     addedge(lx[i],j);

         solve(vN);

         printf("Case #%d:\n",iCase);

         vector<int>ans;

         for(int i = ;i <= n;i++)

         {

             ans.clear();

             for(int j = ; j <= m;j++)

                 if(g[i][j] && Belong[j] == Belong[lx[i]])

                     ans.push_back(j);

             int sz = ans.size();

             printf("%d",sz);

             for(int i = ;i < sz;i++)

                 printf(" %d",ans[i]);

             printf("\n");

         }

     }

     return ;

 }