Fair CodeForces - 987D （一个巧妙的bfs）

最新推荐文章于 2020-12-13 21:58:54 发布

Levi——

最新推荐文章于 2020-12-13 21:58:54 发布

阅读量912

点赞数 1

分类专栏：基础算法

本文链接：https://blog.csdn.net/qq_41874469/article/details/80517147

版权

本文介绍了如何计算在每个城镇举行一场至少需要s种不同商品的公平所需的最低运输费用。通过最短路径算法，计算从每个城镇出发获取所有不同商品类型的最小代价。题目提供了一个BFS解决方案，通过一次性加入所有生产特定类型商品的城市来优化效率。

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

D. Fair

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Some company is going to hold a fair in Byteland. There are $n$ towns in Byteland and $m$ two-way roads between towns. Of course, you can reach any town from any other town using roads.

There are $k$ types of goods produced in Byteland and every town produces only one type. To hold a fair you have to bring at least $s$ different types of goods. It costs $d (u, v)$ coins to bring goods from town $u$ to town $v$ where $d (u, v)$ is the length of the shortest path from $u$ to $v$ . Length of a path is the number of roads in this path.

The organizers will cover all travel expenses but they can choose the towns to bring goods from. Now they want to calculate minimum expenses to hold a fair in each of $n$ towns.

Input

There are $4$ integers $n$ , $m$ , $k$ ,