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).
大致题意:
n个人,m种语言,每个人会若干种语言,同语言或者经过若干可沟通的人翻译的人可以沟通,一人每学一种语言花费+1,求最少花费使得他们之间能相互沟通。
思路:
可沟通的人可视为一个连通块,答案即为连通块数量减一。(特例:如果所有人都什么语言不会,答案为n)
#include<bits/stdc++.h>
using namespace std;
const int maxn=20000+50;
int fa[maxn],n,m,k,x,fr[maxn],ch[maxn],tot=0;
long long ans;
int getfa(int u){
if(fa[u]==u)return u;
return fa[u]=getfa(fa[u]);
}
void unite(int x,int y){
fa[getfa(x)]=fa[getfa(y)];
}
int rd()
{
char c_ = getchar();int x = 0,s = 1;
while(c_ < '0' || c_ > '9') {if(c_ == '-') s = -1;c_ = getchar();}//是符号
while(c_ >= '0' && c_ <= '9') {x = x*10 + c_ -'0';c_ = getchar();}//是数字
return x*s;
}
int main(){
n=rd();m=rd();
int a,b,c;
for(int i=0;i<=n;i++)fa[i]=i;
for(int i=1;i<=n;i++){
k=rd();tot+=k;
while(k--){
x=rd();if(fr[x]==0)fr[x]=i;
else{
unite(fr[x],i);
}
}
}
for(int i=1;i<=n;i++)ch[getfa(i)]++;
for(int i=1;i<=n;i++)if(ch[i]!=0)ans++;
if(ans==n&&tot==0)cout<<n;else
cout<<ans-1;
return 0;
}