Codeforces 170C Learning Languages (并查集求连通分支)

本文介绍了如何应用并查集解决Codeforces上的一个编程挑战,该挑战涉及找到公司中员工之间的最小花费,以便任何员工都能通过翻译与其他人通信。题目描述了公司员工和他们已知的语言,目标是确定使所有员工都能通信所需的最低学习成本。
摘要由CSDN通过智能技术生成
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).

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值