codeforce round 170 A. Learning Languages
来源:互联网 发布:让子弹飞 隐喻 知乎 编辑:程序博客网 时间:2024/05/29 12:55
The "BerCorp" company has got n employees. These employees can usem approved official languages for the formal correspondence. The languages are numbered with integers from1 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 costs1 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 andm (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 thei-th line is integer ki (0 ≤ ki ≤ m) — the number of languages thei-th employee knows. Next, the i-th line contains ki integers —aij (1 ≤ aij ≤ m) — the identifiers of languages thei-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).
5 51 22 2 32 3 42 4 51 5
0
8 703 1 2 31 12 5 42 6 71 32 7 41 1
2
2 21 20
1
这道题真的很奇怪,想了很久,也知道大概就是并查集。。。可就是想不到具体去,结果还是参考了一下别人的结题报告,才有了思路。。。
最主要的就是要将每个人当成一个节点,将他们懂的语言作为联系将他们连接起来,最后判断有几组并查集。。。
这里有特殊情况,就是有可能每个人懂的语言都不相通,这样的话,他们要学的语言就要比之前的还要多出一种
代码:
#include<iostream>#include<string.h>using namespace std;//int pre[100];int fa[105];int a[105][105];int times[105];int find(int re){ if(fa[re]==0){ return re; } else return fa[re]=find(fa[re]);}int totether(int x,int y){ int pre1=find(x); int pre2=find(y); if(pre1==pre2) return 0; else{ fa[pre1]=pre2; return 0; }}int main(){ int n,m; while(cin>>n>>m){ int flag=0; memset(fa,0,sizeof(fa)); // memset(pre,0,sizeof(0)); memset(times,0,sizeof(times)); for(int i=1;i<=n;i++){ int temp; cin>>temp; if(temp>0) flag=1; for(int j=0;j<temp;j++){ int temp1; cin>>temp1; a[temp1][times[temp1]++]=i; } } for(int k=1;k<=m;k++){ for(int g=1;g<times[k];g++){ totether(a[k][g-1],a[k][g]); } } int res=0; for(int i=1;i<=n;i++){ if(fa[i]==0){ res++; } } if(flag==0) cout<<res<<endl; else cout<<res-1<<endl; } return 0; }
- codeforce round 170 A. Learning Languages
- 【Codeforces Round #170 Div. 1】 227A Learning Languages
- 【Codeforces Round #170】Codeforces 277A Learning Languages
- CodeForces 170 A. Learning Languages //搜索
- A. Learning Languages
- codeforce C. Learning Languages(并查集)
- [Codeforces] 277A - Learning Languages
- codeforces 277 A Learning Languages
- Codeforces Round #170 (Div. 2)---C. Learning Languages(并查集)
- Codeforce round #315 A music
- codeforce round A. Binary Protocol
- CodeForce 659A - Round House(水题)
- CodeForce Round #479 A. Karen and Morning
- Codeforce Round #422(Div 2) A
- Codeforce Round #382 (div 1) A
- Codeforce Round #383(Div 1) A
- Codeforce Round #384(Div 2)A
- Codeforce Round #439 A B C 题解
- 连接FTP并执行Command
- linux snmp客户端配置
- 初学试试看cocos2dx的TestCPP框架(7)---AtlasTestScene(LabelTest)
- linux 内核参数
- 猜数字游戏
- codeforce round 170 A. Learning Languages
- 【转】骆家辉对大陆中国人的评价
- JAVA 同步函数以this为锁
- hdu 4308 Saving Princess claire
- ARP协议详解及如何编程实现ARP攻击
- 强大的chrome-很有用的 Chrome 浏览器命令
- 输入二进制数字串,转换成十进制正整数
- C#索引器
- LoadRunner之Block