CF图论一--Learning Languages--并查集

C. Learning Languages

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The "BerCorp" company has got n employees. These employees can use m approved official languages for the formal correspondence. The languages are numbered with integers from 1 to m. For each employee we have the list of languages, which he knows. This list could be empty, i. e. an employee may know no official languages. But the employees are willing to learn any number of official languages, as long as the company pays their lessons. A study course in one language for one employee costs 1 berdollar.

Find the minimum sum of money the company needs to spend so as any employee could correspond to any other one (their correspondence can be indirect, i. e. other employees can help out translating).

Input

The first line contains two integers n and m (2 ≤ n, m ≤ 100) — the number of employees and the number of languages.

Then n lines follow — each employee's language list. At the beginning of the i-th line is integer ki (0 ≤ ki ≤ m) — the number of languages the i-th employee knows. Next, the i-th line contains ki integers — aij (1 ≤ aij ≤ m) — the identifiers of languages the i-th employee knows. It is guaranteed that all the identifiers in one list are distinct. Note that an employee may know zero languages.

The numbers in the lines are separated by single spaces.

Output

Print a single integer — the minimum amount of money to pay so that in the end every employee could write a letter to every other one (other employees can help out translating).

Examples

input

Copy

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

output

Copy

0

input

Copy

8 7
0
3 1 2 3
1 1
2 5 4
2 6 7
1 3
2 7 4
1 1

output

Copy

2

input

Copy

2 2
1 2
0

output

Copy

1

Note

In the second sample the employee 1 can learn language 2, and employee 8 can learn language 4.

In the third sample employee 2 must learn lan  guage 2.

一群人会一些语言，每个人都有k种自己会的语言，问他们通过之间的翻译可以互相听懂

利用并查集，枚举每一个人的语言，若有一样的将它们并起来。最后求出所有的集合数。

#include<bits/stdc++.h>
using namespace std;
#define maxn 2000+66
#define ll long long
int n,m;
int du[maxn];
int edge[maxn][maxn];
int ans;
vector<int>v[200];
int f[200];
int finds(int x)
{
    return f[x]==x?x:f[x]=finds(f[x]);
}
void unions(int x,int y)
{
    int fx=finds(x);
    int fy=finds(y);
    if(fx!=fy)
    {
        f[fx]=fy;
    }
}
int main()
{
    scanf("%d %d",&n,&m);
    for(int i=1; i<=n; i++)
        f[i]=i;
    bool flag=false;
    for(int i=1; i<=n; i++)
    {
        int k;
        scanf("%d",&k);
        if(k!=0)flag=true;//注意这个问题
        while(k--)
        {
            int a;
            scanf("%d",&a);
            v[i].push_back(a);
        }
    }
    for(int i=1; i<=n; i++)
    {
        //判断
        for(int k=1; k<=n; k++)
        {
            for(int j=0; j<v[i].size(); j++)
            {
                for(int o=0;o<v[k].size();o++)
                {
                    if(v[i][j]==v[k][o])
                    {
                        unions(i,k);
                    }
                }
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        finds(i);
    }
    for(int i=1;i<=n;i++)
    {
        if(f[i]==i)ans++;
    }
    if(!flag)printf("%d\n",n);
    else printf("%d\n",ans-1);
}

也可以按语言枚举，这样只用二重循环。即vector里面存的是每一种语言哪些人会。