最小生成树
UCAS王小二
不念过去,不畏未来...
展开
-
畅通工程再续
相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖,发展首先要解决的问题当然是交通问题,政府决定实现百岛湖的全畅通!经过考察小组RPRush对百岛湖的情况充分了解后,决定在符合条件的小岛间建上桥,所谓符合条件,就是2个小岛之间的距离不能小于10米,也不能大于1000米。当然,为了节省资金,只要求实现任意2个小原创 2017-02-09 17:35:24 · 270 阅读 · 0 评论 -
hdu 1879 继续畅通工程(Kruskal)
继续畅通工程Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建道路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N原创 2017-02-26 14:30:47 · 271 阅读 · 0 评论 -
poj 2253 Frogger (kruskal+dijkstra+bellman-ford)
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sun原创 2017-02-13 17:40:38 · 361 阅读 · 0 评论 -
hdu 1233 还是畅通工程
Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结原创 2017-02-07 17:34:49 · 238 阅读 · 0 评论 -
The Unique MST (次小生成树)
Given a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgrap原创 2017-02-08 00:16:47 · 454 阅读 · 0 评论 -
Heavy Transportation(最大生成树)
Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu原创 2017-02-13 22:51:07 · 515 阅读 · 0 评论 -
Highways
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a numb原创 2017-02-10 00:05:31 · 299 阅读 · 0 评论 -
QS Network
In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via networks. If two QS want to get connected, they need to buy two network adapters原创 2017-02-09 21:44:41 · 313 阅读 · 0 评论 -
Constructing Roads
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if t原创 2017-02-09 17:44:56 · 505 阅读 · 0 评论 -
POJ - 3026 Borg Maze【BFS+prim】
Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14533 Accepted: 4728DescriptionThe Borg is an immensely powerful race of enhanced humanoids f原创 2017-07-18 17:28:02 · 264 阅读 · 0 评论