这是一篇关于如何应用Prim算法解决在一个有重边的图中分割通信线路为两个独立公司A和B的问题，确保每个公司都能连接所有城市且成本最小。题目给出输入包含多个案例，每个案例包含城市数量、通信线路数以及各线路的成本。输出要求是找到最小的总成本，若无解则输出"No way!"。解决方案包括先用Kruskal求最小生成树，然后确定必要边并进行二进制枚举找到最优分配。
10807 - Prim
Time limit: 3.000 seconds
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.
最低0.47元/天 解锁文章
扫一扫
1227
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
