Codeforces 653D：Delivery Bears 二分+网络流

最新推荐文章于 2019-05-10 16:07:09 发布

2997ms

最新推荐文章于 2019-05-10 16:07:09 发布

阅读量878

点赞数

分类专栏： Codeforces 图论-最大网络流好玩

本文链接：https://blog.csdn.net/u010885899/article/details/50939106

版权

本文介绍了一道编程题目，涉及到利用二分查找和网络流算法解决熊在加权有向图中公平分配重量的问题。题目要求确定在使用指定数量的熊的情况下，最多可以运输多少重量的商品，保证每条边的负载不超过其容量。通过二分搜索确定每个熊的最大承重，并应用网络流算法计算最大流量，从而得出答案。

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

Niwel is a little golden bear. As everyone knows, bears live in forests, but Niwel got tired of seeing all the trees so he decided to move to the city.

In the city, Niwel took on a job managing bears to deliver goods. The city that he lives in can be represented as a directed graph with nnodes and m edges. Each edge has a weight capacity. A delivery consists of a bear carrying weights with their bear hands on a simple path from node 1 to node n. The total weight that travels across a particular edge must not exceed the weight capacity of that edge.

Niwel has exactly x bears. In the interest of fairness, no bear can rest, and the weight that each bear carries must be exactly the same. However, each bear may take different paths if they like.

Niwel would like to determine, what is the maximum amount of weight he can deliver (it's the sum of weights carried by bears). Find the maximum weight.

Input

The first line contains three integers n,