codeforces 24A Ring road

最新推荐文章于 2020-11-03 21:37:15 发布

Flintx

最新推荐文章于 2020-11-03 21:37:15 发布

阅读量841

点赞数 1

分类专栏： ACM and novicer 图论文章标签： dfs

本文链接：https://blog.csdn.net/qq_15714857/article/details/44003849

版权

这是一道关于图论的编程题，要求找到最小花费将单向道路调整为可以到达所有城市的环形道路。通过深度优先搜索（DFS）策略，从某条道路的终点开始，检查并反转冲突的道路方向，计算总成本。题目提供了多个测试案例，并解释了如何找出最优解决方案。

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

今天写个题解。
一个图论的水题，当然，对我来说简直一筹莫展。
codeforces 24A

A. Ring road

Nowadays the one-way traffic is introduced all over the world in order to improve driving safety and reduce traffic jams. The government of Berland decided to keep up with new trends. Formerly all n cities of Berland were connected by n two-way roads in the ring, i. e. each city was connected directly to exactly two other cities, and from each city it was possible to get to any other city. Government of Berland introduced one-way traffic on all n roads, but it soon became clear that it’s impossible to get from some of the cities to some others. Now for each road is known in which direction the traffic is directed at it, and the cost of redirecting the traffic. What is the smallest amount of money the government should spend on the redirecting of roads so that from every city you can get to any other?

Input
The first line contains integer n (3 ≤ n ≤ 100) — amount of cities (and roads) in Berland. Next n lines contain description of roads. Each road is described by three integers ai, bi, ci (1 ≤ ai, bi ≤ n, ai ≠ bi, 1 ≤ ci ≤ 100) — road is directed from city ai to city bi, redirecting the traffic costs ci.

Output
Output single integer — the smallest amount of money the government should spend on the