Codeforces 278C. Learning Languages 图的遍历
2013-04-08 16:25
148 查看
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).
Sample test(s)
input
output
input
output
input
output
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.
注意有的员工什么语言都不会。。。。
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).
Sample test(s)
input
5 5 1 2 2 2 3 2 3 4 2 4 5 1 5
output
0
input
8 7
03 1 2 3
1 12 5 4
2 6 7
1 3
2 7 4
1 1
output
2
input
2 21 20
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.
注意有的员工什么语言都不会。。。。
#include <iostream> #include <cstring> using namespace std; int n,m; bool lg[111][111]; int a[111][111]; bool v[111]={0}; bool zero[111]={0}; int ex=0; void dfs(int i) { v[i]=true; for (int j=1;j<=n;j++) { if (a[i][j]&&!v[j]) { dfs(j); } } } int main() { cin>>n>>m; for (int i=1;i<=n;i++) { int t; cin>>t; if (t==0) { zero[i]=true; ex++; } while (t--) { int c; cin>>c; lg[i][c]=true; } } for (int i=1;i<=n;i++) { for (int j=1;j<=n;j++) { if (i!=j) { for (int k=1;k<=m;k++) { if (lg[i][k]&&lg[j][k]) { a[i][j]=1; } } } } } int ans=0; for (int i=1;i<=n;i++) { if (!v[i]&&!zero[i]) { dfs(i); ans++; } } ans--; if (ans<0) ans=0; cout<<ans+ex<<endl; return 0; }
相关文章推荐
- codeforces - 707B - Bakery(图的遍历)
- CodeForces 702B: Powers of Two(遍历、穷举)
- Codeforces 34D. Road Map 树的遍历
- Codeforces 278C. Learning Languages 图的遍历
- codeforces - 500A 图的遍历 Java
- Codeforces 34D. Road Map 树的遍历
- Codeforces 29D Ant on the Tree 树的遍历 dfs序
- Codeforces 8B Obsession With Robot 简单图遍历
- dfs 遍历 codeforces 24A
- CodeForces 659E New Reform (图的遍历判环)
- CodeForces 659E New Reform (图的遍历判环)
- CodeForces 446B DZY Loves Modification 经典+贪心+更换遍历对象
- codeforces 919D Substring (拓扑排序 遍历所有通路)
- Codeforces 397A On Segment's Own Points(遍历)
- codeforces 301D. Yaroslav and Divisors(遍历和排序的艺术)
- codeforces 839C Journey(图的遍历)
- CodeForces 302B Eugeny and Play List(遍历)
- Codeforces 29D Ant on the Tree 树的遍历 dfs序
- CodeForces - Hello 2018 B(树的遍历). C(贪心)
- CodeForces - 767C Garland 树的遍历