zoj 2587 Unique Attack 【判断最小割是否唯一】

最新推荐文章于 2019-05-26 22:10:53 发布

笑着走完自己的路

最新推荐文章于 2019-05-26 22:10:53 发布

阅读量1.7k

点赞数 1

分类专栏：网络流

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/48048749

版权

这是一道关于网络连通性的题目，要求通过破坏网络中的光纤连接来隔离两台主要计算机，使得总成本最低。目标是判断是否存在唯一的方法实现这一操作。输入包含超级计算机的数量、光纤连接数以及两台主要计算机的编号。如果最小割唯一，输出"UNIQUE"，否则输出"AMBIGUOUS"。解题策略是通过最大流算法确定最小割是否唯一。

摘要由CSDN通过智能技术生成

Unique Attack

Time Limit: 5 Seconds Memory Limit: 32768 KB

N supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pairs of supercomputers are connected to each other by an optical fibre. All connections are two-way, that is, they can be used in both directions. Data can be transmitted from one computer to another either directly by a fibre, or using some intermediate computers.

A group of terrorists is planning to attack the network. Their goal is to separate two main computers of the network, so that there is no way to transmit data from one of them to another. For each fibre the terrorists have calculated the sum of money they need to destroy the fibre. Of course, they want to minimize the cost of the operation, so it is required that the total sum spent for destroying the fibres was minimal possible.

Now the leaders of the group wonder whether there is only one way to do the selected operation. That is, they want to know if there are no two different sets of fibre connections that can be destroyed, such that the main supercomputers cannot connect to each other after it and the cost of the operation is minimal possible.