生成树
文章平均质量分 84
Lionel_D
这个作者很懒,什么都没留下…
展开
-
hdu 1879 继续畅通工程 最小生成树入门模板题
Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建道路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全省畅通需要的最低成本。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 1< N < 100 );随后的 N(N-1)/2 行对应村庄间道路的成本及修建状态,每行给4个正整数,分别是两个村庄的编号(从原创 2015-02-21 20:54:09 · 822 阅读 · 0 评论 -
poj1258 Agri-Net 最小生成树水题
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55019 Accepted: 22821DescriptionFarmer 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原创 2017-01-09 15:34:02 · 600 阅读 · 0 评论 -
hdu 1598 find the most comfortable road 一开始把此题当做最短路。。后来发现不行。。并查集+枚举
Problem DescriptionXX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求,flycar必须瞬间提速/降速,痛苦呀 ),但XX星人对时间却没那么多要求。要你找出一条城市间的最舒适的路径。(SARS是双向的)。原创 2015-03-29 11:07:05 · 1037 阅读 · 0 评论 -
poj 2349 Arctic Network 最小生成树~~
DescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and som原创 2015-03-26 22:05:57 · 825 阅读 · 0 评论 -
poj1287 Networking 最小生成树模板题。prim+kruskal算法AC
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you a原创 2015-03-26 15:09:43 · 1557 阅读 · 0 评论 -
hdu 2682 Tree 最小生成树~~~~水题一枚,,用到了筛法求素数,我竟然在格式上面PE了两次!!
Problem DescriptionThere are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a prime number or (VA+VB) is a prime number,then they can be connected.W原创 2015-02-24 21:23:48 · 1261 阅读 · 0 评论 -
hdu 4786 Fibonacci Tree 生成树 属于需要仔细想的题目,对图必须非常熟。。今天的首A,太堕落了
Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: Consider a bidirectional graph G with N vertices and M edges. All e原创 2015-02-24 20:07:22 · 995 阅读 · 0 评论 -
hdu 3371 Connect the Cities Prim + Kruskal两种算法分别AC 水过~~~~
Problem DescriptionIn 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 wants to build some roads to connect all of these cities原创 2015-02-23 16:14:15 · 1018 阅读 · 0 评论 -
hdu 2489 Minimal Ratio Tree DFS枚举点+最小生成树 属于中等偏上题 ,Double比较大小的时候注意精度问题
Problem DescriptionFor a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation.Given a complete graph of n nodes with all nodes and edges weighted, your task is to find a tree, which is a sub原创 2015-02-23 23:01:50 · 856 阅读 · 0 评论 -
hdu 1102 Constructing Roads 最小生成树Prim算法AC 水~~~
Problem DescriptionThere 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 there is a road between A and B, or t原创 2015-02-23 14:37:23 · 820 阅读 · 0 评论 -
hdu 1233 还是畅通工程 水题~~~~~~~~~kruskal算法AC
Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 );随后的N(N-1)/2行对应村庄间的距离,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间的距离。为简单起见,村庄从1到N编原创 2015-02-23 14:02:46 · 1043 阅读 · 0 评论 -
hdu 1301 Jungle Roads 一个很水的题 AC率也可以知道了 但是题目很难理解啊 英语渣o(╯□╰)oKruskal算法
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 overtakes roads relentlessly, so the large road network is too expensive to maintain. Th原创 2015-02-23 13:34:47 · 1923 阅读 · 0 评论 -
hdu 1863 畅通工程 最小生成树模板入门题 prim+kruskal两种算法AC。
Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 100 );随后的 N 行对应村庄间道路的成本,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间道路的成本(也是正整原创 2015-02-22 12:12:00 · 949 阅读 · 0 评论 -
hdu 1679 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 subgraph of G, say T = (V', E'), with the following properties: 1原创 2015-02-23 12:35:15 · 1079 阅读 · 0 评论 -
hdu 4081 Qin Shi Huang's National Road System 次小生成树 算法
During the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China ---- they were Qi, Chu, Yan, Han, Zhao, Wei and Qin. Ying Zheng was the king of the kingdom Qin. Through 9 years of wars, he finally conquered all six o原创 2015-02-22 21:43:05 · 945 阅读 · 0 评论 -
hdu 1162 Eddy's picture 最小生成树入门题 Prim+Kruskal两种算法AC
Problem DescriptionEddy 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 pictures to let his friends appreciate. but the result it can原创 2015-02-22 13:24:38 · 874 阅读 · 0 评论 -
hdu 3367 Pseudoforest 伪森林 题目很难懂,模仿kruskal,并查集检查两个节点是否是一个环
PseudoforestTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2880 Accepted Submission(s): 1129Problem DescriptionIn graph theory,原创 2017-03-12 23:44:00 · 907 阅读 · 0 评论