ACM 图论----最小生成树
文章平均质量分 88
青山绿水之辈
奋斗青春年华
展开
-
poj2075Tangled in Cables (最小生成树之prim)
Problem Description You are the owner of SmallCableCo and have purchased the franchise rights for a small town. Unfortunately, you lack enough funds to start your business properly and are relying on原创 2013-08-18 18:15:49 · 1160 阅读 · 0 评论 -
hdu3371Connect the Cities(prim算法优化+自写scanf 函数)
Problem Description In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government原创 2013-08-17 19:19:14 · 1327 阅读 · 0 评论 -
hdu3367Pseudoforest (最大生成树之kruskal 算法)
Problem Description In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The maximal pseudoforests of G are the pseudoforest subgraphs of G原创 2013-08-17 23:35:53 · 3450 阅读 · 0 评论 -
hdu2988Dark roads (最小生成树之kruskal 算法(主要是并查集))
Problem Description Economic times these days are tough, even in Byteland. To reduce the operating costs, the government of Byteland has decided to optimize the road lighting. Till now every road was原创 2013-08-17 23:44:13 · 1372 阅读 · 0 评论 -
POJ1258Agri-Net (最小生成树之prim)
Problem Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer原创 2013-08-18 18:19:49 · 1020 阅读 · 0 评论 -
HDU4313Matrix(用最小生成树思想,集合划分)
Matrix Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2598 Accepted Submission(s): 973 Problem Description Machines have once again原创 2015-03-25 23:10:11 · 803 阅读 · 0 评论 -
HDU4126Genghis Khan the Conqueror(最小生成树+并查集)
Genghis Khan the Conqueror Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others) Total Submission(s): 1687 Accepted Submission(s): 501 Problem Description G原创 2015-03-20 18:20:44 · 1436 阅读 · 0 评论 -
HDU2489Minimal Ratio Tree(最小生成树+状态压缩)
Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2841 Accepted Submission(s): 844 Problem Description For a tree,原创 2015-03-10 18:38:24 · 722 阅读 · 0 评论 -
HDU4081Qin Shi Huang's National Road System(最小生成树+DFS)
Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4227 Accepted Submission(s): 1465 Problem Desc原创 2015-03-11 19:39:54 · 870 阅读 · 0 评论 -
hdu1863 畅通工程(最小生成树之prim)
Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 1原创 2013-08-17 12:34:03 · 947 阅读 · 0 评论 -
hdu1875 畅通工程再续 (最小生成树之prim 算法)
Problem Description 相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖,发展首先要解决的问题当然是交通问题,政府决定实现百岛湖的全畅通!经过考察小组RPRush对百岛湖的情况充分了解后,决定在符合条件的小岛间建上桥,所谓符合条件,就是2个小岛之间的距离不能小于10米,也不能大于1000米原创 2013-08-17 12:28:07 · 1174 阅读 · 0 评论 -
hdu1162 Eddy's picture (最小生成树之prim 算法)
Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictu原创 2013-08-16 23:29:35 · 1138 阅读 · 0 评论 -
POJ2253 Frogger (最小生成树之prim)
Problem Description 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原创 2013-08-19 11:34:47 · 1067 阅读 · 0 评论 -
POJ3723Conscription (最大生成树之Kruskal)
Problem Description Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a sold原创 2013-08-20 14:03:18 · 1166 阅读 · 0 评论 -
POJ1679The Unique MST (最小生成树之Prim )(有点坑人)
Problem Description 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 t原创 2013-08-21 12:19:37 · 1307 阅读 · 0 评论 -
hdu1301Jungle Roads(最小生成树之prim)
Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overt原创 2013-08-22 19:53:31 · 1128 阅读 · 0 评论 -
POJ2031Building a Space Station (最小生成树之prim)
Problem Description You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complet原创 2013-08-22 17:26:06 · 983 阅读 · 0 评论 -
hdu1233 还是畅通工程(最小生成树 prim 算法)
Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结束原创 2013-08-16 18:46:21 · 1074 阅读 · 0 评论 -
hdu1879 继续畅通工程 (最小生成树之prim 算法)
Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建道路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全省畅通需要的最低成本。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 1原创 2013-08-17 10:56:02 · 1051 阅读 · 0 评论 -
hdu1102 Constructing Roads (最小生成树 prim 算法)
Problem Description 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 connec原创 2013-08-16 20:30:30 · 957 阅读 · 0 评论 -
CSU 1633: Landline Telephone Network (最小生成树)
1633: Landline Telephone Network Time Limit: 2 Sec Memory Limit: 128 MB Submit: 63 Solved: 8 [Submit][Status][Web Board] Description The mayor of RMRCity wants to create a secure landli原创 2015-05-24 19:46:13 · 1158 阅读 · 0 评论