UVa 10807 Prim（最小生成树+二进制枚举）

最新推荐文章于 2020-03-14 10:36:32 发布

waShaXiu

最新推荐文章于 2020-03-14 10:36:32 发布

阅读量854

点赞数

分类专栏：图论——最小生成树

本文链接：https://blog.csdn.net/u012596172/article/details/42610761

版权

10807 - Prim

Time limit: 3.000 seconds

Problem ?
Prim, Prim.
Time Limit: 3 seconds

Calax Research and Development is a large high tech corporation. They have an antitrust lawsuit on their hands because they are too big. The judge has ordered that the corporation be split into two new companies, A and B.

Calax has a large network of communication lines that connect a number of cities (each city is connected to every other city by a path of communication lines). They now need to split those lines into two sets, A and B. It is important that each of the two sets still connects all of the cities because the two companies will not be allowed to share communication lines. It has also been decided that all redundant lines will be sold off to protect the two new companies from more antitrust lawsuits. And of course, the total cost of this operation needs to be as small as possible.