poj~1904

Description

Once upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did like. The sons of the king were young and light-headed, so it was possible for one son to like several girls. 

So the king asked his wizard to find for each of his sons the girl he liked, so that he could marry her. And the king's wizard did it -- for each son the girl that he could marry was chosen, so that he liked this girl and, of course, each beautiful girl had to marry only one of the king's sons. 

However, the king looked at the list and said: "I like the list you have made, but I am not completely satisfied. For each son I would like to know all the girls that he can marry. Of course, after he marries any of those girls, for each other son you must still be able to choose the girl he likes to marry." 

The problem the king wanted the wizard to solve had become too hard for him. You must save wizard's head by solving this problem. 

Input

The first line of the input contains N -- the number of king's sons (1 <= N <= 2000). Next N lines for each of king's sons contain the list of the girls he likes: first Ki -- the number of those girls, and then Ki different integer numbers, ranging from 1 to N denoting the girls. The sum of all Ki does not exceed 200000. 

The last line of the case contains the original list the wizard had made -- N different integer numbers: for each son the number of the girl he would marry in compliance with this list. It is guaranteed that the list is correct, that is, each son likes the girl he must marry according to this list. 

Output

Output N lines.For each king's son first print Li -- the number of different girls he likes and can marry so that after his marriage it is possible to marry each of the other king's sons. After that print Li different integer numbers denoting those girls, in ascending order.

Sample Input

4
2 1 2
2 1 2
2 2 3
2 3 4
1 2 3 4

Sample Output

2 1 2
2 1 2
1 3
1 4

Hint

This problem has huge input and output data,use scanf() and printf() instead of cin and cout to read data to avoid time limit exceed.

 

这题第一眼看过去是二分图，看题解才知道是强连通。

喜欢就建立一条边，如果互相喜欢那么就是强连通的

男女能够结婚他们肯定在一个强连通分量里面，

这题加和不加输入输出挂差别是超级大的

下面是放的是加输入输出挂的代码

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;

const int maxn = 1e6 + 10;
int n, m, u, v, tot, top, cnt, flag;
int Scan()
{
    int res=0,ch,flag=0;
    if((ch=getchar())=='-')
        flag=1;
    else if(ch>='0'&&ch<='9')
        res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')
        res=res*10+ch-'0';
    return flag?-res:res;
}
void Out(int a)
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}
struct node {
    int v, next;
} edge[maxn];
int head[maxn], instack[maxn], s[maxn];
int dfn[maxn], low[maxn], belong[maxn];
void init() {
    tot = cnt = top = flag = 0;
    memset(s, 0, sizeof(s));
    memset(head, -1, sizeof(head));
    memset(dfn, 0, sizeof(dfn));
    memset(instack, 0, sizeof(instack));
}
void add(int u, int v) {
    edge[tot].v = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}
void tarjin(int v) {
    dfn[v] = low[v] = ++flag;
    instack[v] = 1;
    s[top++] = v;
    for (int i = head[v] ; i != -1 ; i = edge[i].next) {
        int j = edge[i].v;
        if (!dfn[j]) {
            tarjin(j);
            low[v] = min(low[v], low[j]);
        } else if (instack[j]) low[v] = min(low[v], dfn[j]);
    }
    if (dfn[v] == low[v]) {
        cnt++;
        int t;
        do {
            t = s[--top];
            instack[t] = 0;
            belong[t] = cnt;
        } while(t != v) ;
    }
}
void solve() {
    for (int i = 1 ; i <= n ; i++)
        if (!dfn[i]) tarjin(i);
}
int ans[maxn];
int main() {
    while(scanf("%d", &n) != EOF) {
        init();
        int num;
        memset(ans,0,sizeof(ans));
        for (int i = 1 ; i <= n ; i++) {
            num=Scan();
            while(num--) {
                int v;
                v=Scan();
                add(i, n + v);
            }
        }
        for (int i = 1 ; i <= n ; i++) {
            int v;
            v=Scan();
            add(n + v, i);
        }
        for (int i = 1  ; i <= 2*n ; i++)
            if (!dfn[i]) tarjin(i);
        for (int i = 1 ; i <= n ; i++) {
            int k = 0;
            for (int j = head[i] ; ~j ; j = edge[j].next) {
                if (belong[edge[j].v] == belong[i]) ans[k++] = edge[j].v - n;
            }
            sort(ans, ans + k);
            Out(k);
            for (int i = 0 ; i < k ; i++){
                putchar(' ');
                Out(ans[i]);
            }
            putchar('
');
        }
    }
    return 0;
}