Codeforces Round #170 (Div. 2) C. 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 k_i (0 ≤ k_i ≤ m) — the number of languages the i-th employee knows. Next, the i-th line contains k_i integers — a_ij (1 ≤ a_ij ≤ 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).

Sample test(s)

Input

5 5

1 2

2 2 3

2 3 4

2 4 5

1 5

Output

0

Input

8 7

0

3 1 2 3

1 1

2 5 4

2 6 7

1 3

2 7 4

1 1

Output

2

Input

2 2

1 2

0

Output

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 language 2.

典型的并查集~

需要注意的情况：所有n个人都不会任何语言时，最小付费为n

AC Code：

#include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
#define cti const int
#define ctll const long long
#define dg(i) cout << "*" << i << endl;

int n, m;
bool lan[105][105];  //lan[i]是会第i种语言的人的列表
bool tag[105];  //tag[i]标记编号为i的人是否至少会一种语言
int fa[105];

int Find(int x)
{
    if(x != fa[x]) return fa[x] = Find(fa[x]);
    return x;
}

int main()
{
    int i, j, k, l;
    while(scanf("%d %d", &n, &m) != EOF)
    {
        memset(lan, false, sizeof(lan));
        memset(tag, false, sizeof(tag));
        for(i = 1; i <= n; i++) fa[i] = i;
        for(i = 1; i <= n; i++)
        {
            scanf("%d", &k);
            if(k)
            {
                tag[i] = true;
                while(k--)
                {
                    scanf("%d", &l);
                    lan[l][i] = true;
                }
            }
        }
        for(l = 1; l <= m; l++)
        {
            for(j = 1; !lan[l][j] && j < n; j++){}
            if(j < n)
            {
                int f1 = Find(j);
                for(i = j + 1; i <= n; i++)
                    if(lan[l][i])  //编号为i的人也会语言l
                    {
                        int f2 = Find(i);
                        if(f2 > f1) fa[f2] = f1;
                        else if(f2 < f1) f1 = fa[f1] = f2;
                    }
            }
        }
        set<int> S;
        for(i = 1; i <= n; i++)
            S.insert(Find(i));
        int ans = S.size();
        for(i = 1; i <= n && !tag[i]; i++){}
        if(i <= n) ans--;
        printf("%d\n", ans);
    }
    return 0;
}