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

（寒假集训）Watering the Fields （最小生成树）
摘要：Watering the Fields 时间限制: 1 Sec 内存限制: 64 MB提交: 26 解决: 10[提交][状态][讨论版] 题目描述 Due to a lack of rain, Farmer John wants to build an irrigation system to s 阅读全文
posted @ 2017-01-12 20:06 贱人方 阅读(317) 评论(0) 推荐(0)
URAL 1160 Network(最小生成树)
摘要：Network Time limit: 1.0 secondMemory limit: 64 MB Andrew is working as system administrator and is planning to establish a new network in his company. 阅读全文
posted @ 2016-10-27 14:43 贱人方 阅读(227) 评论(0) 推荐(0)
URAL(timus) 1272 Non-Yekaterinburg Subway(最小生成树)
摘要：Non-Yekaterinburg Subway Time limit: 1.0 secondMemory limit: 64 MB A little town started to construct a subway. The peculiarity of the town is that it 阅读全文
posted @ 2016-09-09 20:40 贱人方 阅读(240) 评论(0) 推荐(0)
timus 1982 Electrification Plan(最小生成树)
摘要：Electrification Plan Time limit: 0.5 secondMemory limit: 64 MB Some country has n cities. The government has decided to electrify all these cities. At 阅读全文
posted @ 2016-09-07 20:32 贱人方 阅读(246) 评论(0) 推荐(0)
Superbull（最大生成树）（Kruskal）
摘要：Superbull 时间限制: 1 Sec 内存限制: 64 MB提交: 49 解决: 13[提交][状态][讨论版] 题目描述 Bessie and her friends are playing hoofball in the annual Superbull championship, and 阅读全文
posted @ 2016-08-20 19:57 贱人方 阅读(709) 评论(0) 推荐(0)
POJ1679 The Unique MST(Kruskal)（最小生成树的唯一性）
摘要：The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27141 Accepted: 9712 Description Given a connected undirected graph, tell if 阅读全文
posted @ 2016-08-04 12:20 贱人方 阅读(3187) 评论(0) 推荐(0)
POJ3026 Borg Maze(Prim)(BFS)
摘要：Borg Maze Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12729 Accepted: 4153 Description The Borg is an immensely powerful race of enhanc 阅读全文
posted @ 2016-08-03 13:01 贱人方 阅读(291) 评论(0) 推荐(0)
POJ1258 Agri-Net(Prim）
摘要：Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 51685 Accepted: 21558 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2016-08-03 10:40 贱人方 阅读(204) 评论(0) 推荐(0)
POJ1751 Highways(Prim)
摘要：Highways Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13182 Accepted: 3814 Special Judge Description The island nation of Flatopia is pe 阅读全文
posted @ 2016-08-03 10:00 贱人方 阅读(904) 评论(0) 推荐(0)
POJ2349 Arctic Network(Prim)
摘要：Arctic Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16968 Accepted: 5412 Description The Department of National Defence (DND) wi 阅读全文
posted @ 2016-08-02 19:07 贱人方 阅读(303) 评论(0) 推荐(0)
POJ1789 Truck History(Prim)
摘要：Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24724 Accepted: 9636 Description Advanced Cargo Movement, Ltd. uses trucks of 阅读全文
posted @ 2016-08-02 17:08 贱人方 阅读(202) 评论(0) 推荐(0)
POJ2032 Building a Space Station(Kruskal)(并查集）
摘要：Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7469 Accepted: 3620 Description You are a member of the space stat 阅读全文
posted @ 2016-08-02 14:20 贱人方 阅读(411) 评论(0) 推荐(0)
POJ1251 Jungle Roads(Kruskal)(并查集）
摘要：Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23882 Accepted: 11193 Description The Head Elder of the tropical island of Lag 阅读全文
posted @ 2016-08-02 12:53 贱人方 阅读(197) 评论(0) 推荐(0)
POJ1861 Network(Kruskal)(并查集）
摘要：Network Time Limit: 1000MS Description Andrew is working as system administrator and is planning to establish a new network in his company. There will 阅读全文
posted @ 2016-08-02 12:20 贱人方 阅读(465) 评论(0) 推荐(0)
vijos P1234口袋的天空(Kruskal)(最小生成树)
摘要：P1234口袋的天空 小杉坐在教室里，透过口袋一样的窗户看口袋一样的天空。 有很多云飘在那里，看起来很漂亮，小杉想摘下那样美的几朵云，做成棉花糖。 P1234口袋的天空 小杉坐在教室里，透过口袋一样的窗户看口袋一样的天空。 有很多云飘在那里，看起来很漂亮，小杉想摘下那样美的几朵云，做成棉花糖。 描述 阅读全文
posted @ 2016-08-02 10:33 贱人方 阅读(388) 评论(0) 推荐(0)
vijos P1190繁忙的都市(Kruskal)(最小生成树)
摘要：P1190 繁忙的都市 城市C是一个非常繁忙的大都市，城市 中的道路十分的拥挤，于是市长决定对其中的道路进行改造。城市C的道路是这样分布的：城市中有n个交叉路口，有些交叉路口之间有道路相连，两个交叉路口之 间最多有一条道路相连接。这些道路是双向的，且把所有的交叉路口直接或间接的连接起来了。每条道路都 阅读全文
posted @ 2016-08-02 10:08 贱人方 阅读(394) 评论(0) 推荐(0)
最小生成树（Kruskal)(并查集)
摘要：最小生成树 时间限制: 1 Sec 内存限制: 64 MB提交: 11 解决: 2[提交][状态][讨论版] 题目描述 某个宇宙帝国有N个星球，由于宇宙的空间是三维的，因此每个星球的位置可以用三维坐标(X，Y，Z)来表示。任意两个不同的星球i和j都有一条边相连，边的距离是这样计算的：dis[i，j] 阅读全文
posted @ 2016-08-01 15:48 贱人方 阅读(673) 评论(0) 推荐(0)
灯泡游戏 （Kruskal)(并查集)
摘要：灯泡游戏 时间限制: 1 Sec 内存限制: 64 MB提交: 9 解决: 4[提交][状态][讨论版] 题目描述 有 一个n行m列的矩阵，左上角坐标是(0,0)，右下角坐标是(n-1,m-1)。每个格子有一个字符， “0”至“9”表示数字0至9，“a”至“z”表示数字10至35，“A”至“Z”表示 阅读全文
posted @ 2016-08-01 11:35 贱人方 阅读(525) 评论(0) 推荐(1)