CodeForces 277A Learning Language

题目

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).

输入

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.

输出

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).

思路

利用并查集找出没有联系的集合的数量，答案就是这个数量-1， 注意特殊情况是所有人都不会官方语言，此时答案应该为1

代码

#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;

int graph[105][105];
int father[105];
int n, m;

int find(int num)
{
	if(father[num] != num) father[num] = find(father[num]);
	
	return father[num];
}

void unionn(int x, int y)
{
	int temp;
	if(x > y) temp = y, y = x, x = temp;
	
	x = find(x);
	y = find(y);
	if(x != y) father[y] = x;
	//printf("unionn\n");
}

int main()
{
	scanf("%d %d", &n, &m);
	memset(graph, 0, sizeof(graph));
	
	int k, l;
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &k);
		while(k--)
		{
			scanf("%d", &l);
			graph[i][l] = 1;
		}
	}
	
	for(int i = 1; i <= n; i++) father[i] = i;
	
	int first;
	for(int i = 1; i <= m; i++)
	{
		for(first = 1; first <= n; first++)
		{
			if(graph[first][i]) break;
			//printf("51\n");
		}
		
		for(int j = first+1; j <= n; j++)
		{
			if(graph[j][i]) unionn(first, j);//,printf("com%dand%d\n", first, j);		
		}
		
	}
	
	int sum = 0;
	for(int i = 1; i <= n; i++)
	{
		if(father[i] == i) sum++;
	}
	
	int tag = 0;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			if(graph[i][j])  tag = 1;
		}
	}
	
	if(tag) printf("%d", sum-1);
	else printf("%d", n);
	
	
}