----生成树
Wang_128
这个作者很懒,什么都没留下…
展开
-
HDU1162-Eddy's picture
Eddy's picture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2016-09-10 21:08:41 · 235 阅读 · 0 评论 -
2017华东师范大学网赛-铁路修复计划
铁路修复计划Time limit per test: 2.0 secondsTime limit all tests: 15.0 secondsMemory limit: 256 megabytes在 A 国有很多城际铁路。这些铁路都连接两个城市(城市从 1 到 n 编号),可以双向通行,使得任意两个城市之间都由铁路网联系起来。不过在一次星球大战之后,所有的原创 2017-05-14 23:41:19 · 433 阅读 · 2 评论 -
HDU1233-还是畅通工程(Prim算法+Kruskal算法)
还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2016-09-10 20:49:51 · 252 阅读 · 0 评论 -
HDU1879-继续畅通工程(Prim算法+Kruskal算法)
继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-10 21:01:14 · 280 阅读 · 0 评论 -
HDU1863-畅通工程(Prim算法+Kruskal算法)
畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-10 20:53:25 · 373 阅读 · 0 评论 -
HDU1875-畅通工程再续(Prim算法+Kruskal算法)
畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-10 21:05:05 · 263 阅读 · 0 评论 -
FZU2087-统计树边
Problem 2087 统计树边Accept: 226 Submit: 704Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description在图论中,树:任意两个顶点间有且只有一条路径的图。生成树:包含了图中所有顶点的一种树。最小生成树:对于连通的带权图(连通网)G,其生成树也原创 2017-04-10 21:20:18 · 374 阅读 · 0 评论 -
HYSBZ1083-繁忙的都市
1083: [SCOI2005]繁忙的都市Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 2575 Solved: 1687[Submit][Status][Discuss]Description 城市C是一个非常繁忙的大都市,城市中的道路十分的拥挤,于是市长决定对其中的道路进行改造。城市C的道路是这样分布的:城市中有原创 2016-12-01 21:09:38 · 432 阅读 · 0 评论 -
HDU6187-Destroy Walls
Destroy Walls Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)原创 2017-09-12 15:27:31 · 236 阅读 · 0 评论 -
HDU2121-Ice_cream’s world II(最小树形图)
Ice_cream’s world II Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-03-24 22:24:03 · 269 阅读 · 0 评论 -
HDU4085-Peach Blossom Spring
Peach Blossom Spring Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-11-13 20:05:40 · 666 阅读 · 0 评论 -
ZOJ3613-Wormhole Transport
Wormhole TransportTime Limit: 3 Seconds Memory Limit: 65536 KBWormhole is a kind of two-way tunnel between two planets which can make it possible to transport large amounts of resources原创 2017-11-13 20:08:33 · 430 阅读 · 0 评论 -
HDU3311-Dig The Wells
Dig The Wells Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2017-11-13 20:17:11 · 439 阅读 · 0 评论 -
POJ3123-Ticket to Ride
Ticket to RideTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 805 Accepted: 366DescriptionTicket to Ride is a board game for up to 5 players. The goal原创 2017-11-13 20:20:57 · 585 阅读 · 0 评论 -
ZOJ3204-Connect them
Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections a原创 2017-04-12 22:10:47 · 468 阅读 · 0 评论 -
ZOJ2966-Build The Electric System
Build The Electric SystemTime Limit: 2 Seconds Memory Limit: 65536 KBIn last winter, there was a big snow storm in South China. The electric system was damaged seriously. Lots of power原创 2017-04-11 23:00:55 · 477 阅读 · 0 评论 -
HDU4009-Transfer water
Transfer water Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)原创 2017-03-24 22:32:44 · 274 阅读 · 0 评论 -
HDU4463-Outlets
Outlets Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-10 21:11:16 · 223 阅读 · 0 评论 -
HDU2489-Minimal Ratio Tree
Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-10 21:20:45 · 268 阅读 · 0 评论 -
HDU1102-Constructing Roads
Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2016-09-11 13:53:33 · 208 阅读 · 0 评论 -
HDU3367-Pseudoforest
Pseudoforest Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)原创 2016-09-11 13:59:26 · 195 阅读 · 0 评论 -
HDU3371-Connect the Cities
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-09-11 14:12:38 · 268 阅读 · 0 评论 -
最小生成树
最小生成树 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-03-19 21:20:44 · 331 阅读 · 0 评论 -
HDU1301-Jungle Roads
Jungle Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2016-09-10 21:28:14 · 221 阅读 · 0 评论 -
POJ1679-The Unique MST
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29566 Accepted: 10583DescriptionGiven a connected undirected graph, tell if its minimum原创 2017-03-24 19:39:19 · 283 阅读 · 0 评论 -
UVA10600-ACM Contest and Blackout
题意:给出n个点,m条边,计算最小生成树和次小生成树#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longcons原创 2017-03-24 20:00:10 · 237 阅读 · 0 评论 -
HDU4081-Qin Shi Huang's National Road System(次小生成树)
Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-03-24 19:57:02 · 386 阅读 · 0 评论 -
UVA10462-Is There A Second Way Left?
题意:有n个点,m条边,求最小生成树#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longconst int IN原创 2017-03-24 20:05:57 · 337 阅读 · 0 评论 -
UVA11183-Teen Girl Squad
题意:有n个点,m条有向边,问能不能从0号点做到所有点,并求出最小权值解题思路:最小树形图#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#def原创 2017-03-24 22:08:16 · 553 阅读 · 0 评论 -
POJ3164-Command Network
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 17829 Accepted: 5111DescriptionAfter a long lasting war on words, a war on arms fina原创 2017-03-24 20:09:57 · 306 阅读 · 0 评论 -
HYSBZ2595-游览计划(斯坦纳树)
[Wc2008]游览计划Time Limit: 10 Sec Memory Limit: 256 MBSec Special JudgeSubmit: 1790 Solved: 859[Submit][Status][Discuss]DescriptionInput第一行有两个整数,N和 M,描述方块的数目。 接下来 N行, 每行有 M 个非负原创 2017-11-13 20:26:14 · 338 阅读 · 0 评论