codeforces 733 F. Drivers Dissatisfaction(最小生成树+lca+倍增去环)

最新推荐文章于 2020-08-20 08:55:32 发布

___fouzhe

最新推荐文章于 2020-08-20 08:55:32 发布

阅读量900

点赞数

分类专栏： lca 树最小生成树

本文链接：https://blog.csdn.net/fouzhe/article/details/62037261

版权

在王国中，需要从预算S Lamziks中选择n-1条主要道路以最小化司机不满。每条道路的不满程度和改善成本已知。通过贪心策略找到最小生成树，并考虑将额外资金用于降低一条边的不满，可能形成环并使用LCA和倍增法去环，以求得最优解决方案。

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

题目链接

F. Drivers Dissatisfaction

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In one kingdom there are n cities and m two-way roads. Each road connects a pair of cities, and for each road we know the level of drivers dissatisfaction — the value wi.

For each road we know the value ci — how many lamziks we should spend to reduce the level of dissatisfaction with this road by one. Thus, to reduce the dissatisfaction with the i-th road by k, we should spend k·ci lamziks. And it is allowed for the dissatisfaction to become zero or even negative.

In accordance with the king's order, we need to choose n - 1 roads and make them the main roads. An important condition must hold: it should be possible to travel from any city to any other by the main roads.

The road ministry has a budget of S lamziks for the reform. The ministry is going to spend this budget for repair of some roads (to reduce the dissatisfaction with them), and then to choose the n - 1 main roads.

Help to spend the budget in such a way and then to choose the main roads so that the total dissatisfaction with the main roads will be as small as possible. The dissatisfaction with some roads can become negative. It is not necessary to spend whole budget S.

It is guaranteed that it is possible to travel from any city to any other using existing roads. Each road in the kingdom is a two-way road.

Input

The first line contains two integers n and m (2 ≤ n ≤ 2·105, n - 1 ≤ m ≤ 2·105) — the number of cities and the number of roads in the kingdom, respectively.

The second line contains m inte