...树~最小生成树&&并差集 - 随笔分类 - handsomecui

连接的管道（最小生成树）

摘要：连接的管道 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1961 Accepted Submission(s): 687 Problem D 阅读全文

posted @ 2016-04-08 10:59 handsomecui 阅读(479) 评论(0) 推荐(0) 编辑

修路方案（次小生成树）

摘要：修路方案时间限制：3000 ms | 内存限制：65535 KB 难度：5 描述南将军率领着许多部队，它们分别驻扎在N个不同的城市里，这些城市分别编号1~N，由于交通不太便利，南将军准备修路。现在已经知道哪些城市之间可以修路，如果修路，花费是多少。现在，军师小工已经找到了一种修路的方案，能够阅读全文

posted @ 2016-03-02 18:51 handsomecui 阅读(485) 评论(0) 推荐(0) 编辑

Rikka with Graph(联通图取边，暴力)

摘要：Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 190 Accepted Submission(s): 78 阅读全文

posted @ 2016-02-21 08:02 handsomecui 阅读(573) 评论(0) 推荐(0) 编辑

UVA - 10129Play on Words（欧拉路）

摘要：UVA - 10129Play on WordsSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solveit to open that doors.... 阅读全文

posted @ 2016-01-04 15:32 handsomecui 阅读(403) 评论(0) 推荐(0) 编辑

tree（简单并差集）

摘要：treeAccepts: 156Submissions: 807Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionThere is a tree(the ... 阅读全文

posted @ 2016-01-02 21:09 handsomecui 阅读(313) 评论(0) 推荐(0) 编辑

第八届河南省赛D.引水工程（kruthcra+prime）

摘要：D.引水工程Time Limit:2 SecMemory Limit:128 MB Submit:118Solved:41 [Submit][Status][Web Board]Description南水北调工程是优化水资源配置、促进区域协调发展的基础性工程，是新中国成立以来投资额最大、涉及面最广的... 阅读全文

posted @ 2016-01-02 12:27 handsomecui 阅读(326) 评论(0) 推荐(0) 编辑

第七届河南省赛B.海岛争霸（并差集）

摘要：B.海岛争霸Time Limit:2 SecMemory Limit:128 MB Submit:130Solved:48 [Submit][Status][Web Board]Description神秘的海洋，惊险的探险之路，打捞海底宝藏，激烈的海战，海盗劫富等等。加勒比海盗，你知道吧？杰克船长驾... 阅读全文

posted @ 2016-01-01 21:26 handsomecui 阅读(214) 评论(0) 推荐(0) 编辑

3027 - Corporative Network（并差集）

摘要：3027 - Corporative Network A very big corporation is developing its corporative network. In the beginning each of the N enterprisesof the corpora... 阅读全文

posted @ 2015-12-04 17:56 handsomecui 阅读(467) 评论(0) 推荐(0) 编辑

3644 - X-Plosives（水题，并差集）

摘要：3644 - X-PlosivesA secret service developed a new kind of explosive that attain its volatile property only when a specificassociation of products occu... 阅读全文

posted @ 2015-12-01 22:23 handsomecui 阅读(256) 评论(0) 推荐(0) 编辑

find the most comfortable road（并差集，找差值最小的权值）

摘要：find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5359Accepted Submiss... 阅读全文

posted @ 2015-10-23 21:06 handsomecui 阅读(612) 评论(0) 推荐(0) 编辑

Junk-Mail Filter(并差集删点)

摘要：Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7755Accepted Submission(s): 2449P... 阅读全文

posted @ 2015-10-22 19:44 handsomecui 阅读(522) 评论(0) 推荐(0) 编辑

Cube Stacking(并差集深度+结点个数)

摘要：Cube Stacking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 21567 Accepted: 7554 Case Time Limit: 1000MS Description Farmer John and Bets 阅读全文

posted @ 2015-09-27 16:23 handsomecui 阅读(890) 评论(0) 推荐(0) 编辑

The Suspects(并查集求节点数)

摘要：The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:28164Accepted:13718DescriptionSevere acute respiratory syndrome (SARS), an atypical ... 阅读全文

posted @ 2015-09-19 21:46 handsomecui 阅读(219) 评论(0) 推荐(0) 编辑

布线问题(prime)

摘要：布线问题时间限制：1000 ms | 内存限制：65535 KB 难度：4描述南阳理工学院要进行用电线路改造，现在校长要求设计师设计出一种布线方式，该布线方式需要满足以下条件：1、把所有的楼都供上电。2、所用电线花费最少输入第一行是一个整数n表示有n组测试数据。(n 2 #include 3 con... 阅读全文

posted @ 2015-09-18 22:38 handsomecui 阅读(229) 评论(0) 推荐(0) 编辑

Agri-Net

摘要：Agri-NetTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 8Accepted Submission(s) : 4Problem Descript... 阅读全文

posted @ 2015-08-13 21:37 handsomecui 阅读(185) 评论(0) 推荐(0) 编辑

Network（）

摘要：NetworkTime Limit : 2000/1000ms (Java/Other)Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 17Accepted Submission(s) : 8Special JudgePro... 阅读全文

posted @ 2015-08-13 21:34 handsomecui 阅读(244) 评论(0) 推荐(0) 编辑

Conscription

摘要：ConscriptionTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 13Accepted Submission(s) : 6Problem De... 阅读全文

posted @ 2015-08-13 21:30 handsomecui 阅读(268) 评论(0) 推荐(0) 编辑

Matrix（类似kruskal）

摘要：MatrixTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 1Problem Descriptio... 阅读全文

posted @ 2015-08-13 17:21 handsomecui 阅读(289) 评论(0) 推荐(0) 编辑

Highways（求最小生成树的最大边）

摘要：HighwaysTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 1Problem Descrip... 阅读全文

posted @ 2015-08-13 11:14 handsomecui 阅读(274) 评论(0) 推荐(0) 编辑

The Unique MST （判断是否存在多个最小生成树）

摘要：The Unique MST Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 24058Accepted: 8546DescriptionGiven a connecte... 阅读全文

posted @ 2015-08-13 10:52 handsomecui 阅读(743) 评论(0) 推荐(0) 编辑

handsomecui

随笔分类 - ...树~最小生成树&&并差集

公告