随笔分类 -  图论--最小生成树

摘要:1002: [FJOI2007]轮状病毒 Description 轮状病毒有很多变种,所有轮状病毒的变种都是从一个轮状基产生的。一个N轮状基由圆环上N个不同的基原子 和圆心处一个核原子构成的,2个原子之间的边表示这2个原子之间的信息通道。如下图所示 N轮状病毒的产生规律是在一个N轮状基中删去若干条边 阅读全文
posted @ 2017-09-21 17:51 勿忘初心0924 阅读(147) 评论(0) 推荐(0) 编辑
摘要:1016: [JSOI2008]最小生成树计数 Description 现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树,而希望知道这个图中有多少个不同的 最小生成树。(如果两颗最小生成树中至少有一条边不同,则这两个最小生成树就是不同的)。由于不同的最小生 成树可能很多,所以你只需要输 阅读全文
posted @ 2017-09-12 17:54 勿忘初心0924 阅读(153) 评论(0) 推荐(0) 编辑
摘要:Out of Hay Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17502 Accepted: 6888 Description The cows have run out of hay, a horrible event 阅读全文
posted @ 2017-07-22 17:47 勿忘初心0924 阅读(163) 评论(0) 推荐(0) 编辑
摘要:Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 59025 Accepted: 24473 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2017-07-22 15:46 勿忘初心0924 阅读(141) 评论(0) 推荐(0) 编辑
摘要:Pseudoforest Problem Description In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The 阅读全文
posted @ 2016-12-09 00:00 勿忘初心0924 阅读(453) 评论(0) 推荐(0) 编辑
摘要:Connect the Cities Problem Description In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connecte 阅读全文
posted @ 2016-12-08 22:20 勿忘初心0924 阅读(372) 评论(0) 推荐(0) 编辑
摘要:Jungle Roads Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roa 阅读全文
posted @ 2016-12-08 10:47 勿忘初心0924 阅读(830) 评论(0) 推荐(0) 编辑
摘要:继续畅通工程 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建道路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全省畅通需要 阅读全文
posted @ 2016-12-08 09:51 勿忘初心0924 阅读(294) 评论(0) 推荐(0) 编辑
摘要:还是畅通工程 Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Inp 阅读全文
posted @ 2016-12-08 09:31 勿忘初心0924 阅读(133) 评论(0) 推荐(0) 编辑
摘要:Eddy's picture Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pict 阅读全文
posted @ 2016-12-07 22:24 勿忘初心0924 阅读(719) 评论(0) 推荐(0) 编辑
摘要:Constructing Roads Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villa 阅读全文
posted @ 2016-12-07 22:04 勿忘初心0924 阅读(639) 评论(0) 推荐(0) 编辑