这是一个关于求解在给定旅行时间限制下，从矿山到工厂的最大容量路径的问题。输入包含测试用例数、节点数、边数及时间限制，每个边有容量和旅行时间。输出为满足时间条件的最大路径容量。样例输入给出了两个测试用例，每个用例有不同的图结构和时间限制，输出对应的最大容量。
Problem Description
Consider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 corresponds to a mine from where some precious minerals are extracted. The vertex numbered with N corresponds to a minerals processing factory. Each edge has an associated travel time (in time units) and capacity (in units of minerals). It has been decided that the minerals which are extracted from the mine will be delivered to the factory using a single path. This path should have the highest capacity possible, in order to be able to transport simultaneously as many units of minerals as possible. The capacity of a path is equal to the smallest capacity of any of its edges. However, the minerals are v
订阅专栏 解锁全文
扫一扫
221
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
