图
关注
分享
扫一扫
文章平均质量分 84
剑不飞
时刻思考，找准方向，坚定执行，永不服输（AC才是王道。）
展开
-
ZOJ 3780 Paint the Grid Again(topsort)
ZOJ Problem Set - 3780Paint the Grid AgainTime Limit: 2 Seconds Memory Limit: 65536 KBLeo has a grid with N × N cells. He wants to paint each cell with a specific color (either black原创 2014-05-08 21:35:50 · 1146 阅读 · 0 评论 -
HDU 3072 Intelligence System （强连通缩点+简单最小树形图，4级）
D - Intelligence SystemCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Appoint description:System C原创 2013-08-31 21:35:18 · 665 阅读 · 0 评论 -
hdu 4685 Prince and Princess(最大匹配+强连通所点，5级)
Prince and PrincessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 248 Accepted Submission(s): 76Problem DescriptionThere are n p原创 2013-08-16 13:20:29 · 1080 阅读 · 0 评论 -
hdu 4679 Terrorist’s destroy (DP or 树直径，4级)
Terrorist’s destroyTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 132 Accepted Submission(s): 20Problem DescriptionThere is a ci原创 2013-08-15 18:35:46 · 1017 阅读 · 0 评论 -
hdu 4650 Minimum Average Weight Path（最短路，5级）
第4场多校联合训练解题报告——详见杭电ACM微博~Minimum Average Weight PathTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 94 Accepted Submissio原创 2013-08-07 16:47:14 · 1286 阅读 · 0 评论 -
hdu 4396 More lumber is required(最短路，SPFA，4级)
More lumber is requiredTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 909 Accepted Submission(s): 377Problem Description“More原创 2013-08-04 20:20:10 · 722 阅读 · 0 评论 -
hdu 2686 Matrix(多线程DPor费用流，5级)
P - MatrixTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionYifenfei very lik原创 2013-08-03 14:30:24 · 779 阅读 · 0 评论 -
hdu 1853 Cyclic Tour(费用流OR二分图最佳匹配，5级)
O - Cyclic TourTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionThere are N原创 2013-08-03 15:23:45 · 814 阅读 · 0 评论 -
UVA1146 Now or later(2-sat,4级)
DescriptionAs you must have experienced, instead of landing immediately, an aircraft sometimes waits in a holding loop close to the runway. This holding mechanism is required by air traffic co原创 2013-07-06 11:22:49 · 939 阅读 · 0 评论 -
UVA 11324 Problem B: The Largest Clique(强连通+DP，4级)
Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between tw原创 2013-07-05 16:09:12 · 877 阅读 · 0 评论 -
uva 12167 - Proving Equivalences(强连通缩点，4级)
Consider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:A is invertible.Ax = b has exactly one so原创 2013-07-04 21:46:19 · 915 阅读 · 0 评论 -
HDU 1068 Girls and Boys(二分图最大独立点集,3级)
Girls and BoysTime Limit:10000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Appoint description: System Crawler (2012-10-30)Descriptionthe secon原创 2013-07-19 16:47:28 · 1048 阅读 · 0 评论 -
uva 1364 - Knights of the Round Table(点双连通分量，5级)
Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very surprising tha原创 2013-06-29 21:49:00 · 1141 阅读 · 0 评论 -
hdu 2063 过山车（二分图最大匹配，2级）
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6952 Accepted Submission(s): 3020Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以原创 2013-07-15 19:18:23 · 640 阅读 · 0 评论 -
UVA 11478 Halum(差分约束，5级)
Problem HHalumTime Limit : 3 seconds You are given a directed graph G(V,E) with a set of vertices and edges. Each edge (i,j) that connects some vertex i to vertex j has原创 2013-07-11 10:39:08 · 992 阅读 · 0 评论 -
USCAO section 4.1 Fence Loops（最短路，最小环，5级）
Fence LoopsThe fences that surround Farmer Brown's collection of pastures have gotten out of control. They are made up of straight segments from 1 through 200 feet long that join together only a原创 2013-07-08 19:32:49 · 881 阅读 · 0 评论 -
hdu 4337 King Arthur's Knights(哈密顿回路，4级)
King Arthur's KnightsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1403 Accepted Submission(s): 606Special JudgeProblem Descripti原创 2013-06-22 11:21:26 · 744 阅读 · 0 评论 -
hdu 4714 Tree2cycle(简单图或树DP，4级)
Tree2cycleTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 354 Accepted Submission(s): 65Problem DescriptionA tree with N nodes原创 2013-09-08 20:25:49 · 853 阅读 · 0 评论 -
hdu 4598 Difference(spfa+差分约束，4级)
如果本网站登录不畅，可以从以下地址访问：http://code.hdu.edu.cnDifferenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 236 Accepted Submission(s原创 2013-09-10 19:55:42 · 959 阅读 · 0 评论 -
hdu 4725 The Shortest Path in Nya Graph(堆+dij,最短路，5级)
The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 193 Accepted Submission(s): 38Problem DescriptionTh原创 2013-09-11 20:12:30 · 1107 阅读 · 2 评论 -
hdu 4587 TWO NODES (枚举+割点，5级)
TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 179Problem DescriptionSuppose that原创 2013-10-29 22:02:45 · 653 阅读 · 0 评论 -
全局最小割
一个无向连通网络，去掉一个边集可以使其变成两个连通分量则这个边集就是割集；最小割集当然就权和最小的割集。可以用最小切割最大流定理：1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流，并确定当前源汇的最小割集，若比min小更新min4.转到2直到枚举完毕5.min即为所求输出min 不难看出复杂度很高：枚举汇点要O(n)，最原创 2013-10-18 20:58:40 · 1052 阅读 · 0 评论 -
HDU 4081 Qin Shi Huang's National Road System（次小树，4级）
A - Qin Shi Huang's National Road SystemTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-08-20)De原创 2013-10-16 15:15:29 · 649 阅读 · 0 评论 -
UVA 11865 Stream My Contest（最小树形图，4级）
C - Stream My ContestTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionG原创 2013-10-16 15:19:25 · 844 阅读 · 0 评论 -
UVA 10600 ACM Contest and Blackout（次小树，3级）
F - ACM Contest and BlackoutTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-10-08)DescriptionProbl原创 2013-10-16 15:21:07 · 880 阅读 · 0 评论 -
UVALive 3887 Slim Span（枚举+MST，4级）
E - Slim SpanTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-06-01)DescriptionGiven an undirec原创 2013-10-16 13:44:40 · 732 阅读 · 0 评论 -
UVA 11354 Bond(prim+LCA,4级)
B - BondTime Limit:8000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionBNEXT原创 2013-10-15 11:58:06 · 812 阅读 · 0 评论 -
POJ 3694 Network（双连通+LCA，5级）
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6013 Accepted: 2091DescriptionA network administrator manages a large network. The network cons原创 2013-10-13 19:05:25 · 726 阅读 · 0 评论 -
POJ 3177 Redundant Paths(边双连通分量，3级)
A - Redundant PathsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: bjtu_lyc (2011-08-08)System Crawler (2013-09-29)D原创 2013-10-12 20:55:10 · 557 阅读 · 0 评论 -
HDU 3605 Escape(多重KM，4级)
F - EscapeTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-09-29)Description2012 If this is t原创 2013-10-12 12:47:55 · 741 阅读 · 0 评论 -
HDU 2389 Rain on your Parade(HK||KM,4级)
E - Rain on your ParadeTime Limit:3000MS Memory Limit:165535KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-09-09)DescriptionYou原创 2013-10-12 12:44:51 · 657 阅读 · 0 评论 -
POJ 1719 Shooting Contest（KM，4级）
I - Shooting ContestTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionWelco原创 2013-10-12 14:10:51 · 571 阅读 · 0 评论 -
HDU 3829 Cat VS Dog（二分图，4级）
C - Cat VS DogTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionThe zoo have原创 2013-10-11 21:31:34 · 853 阅读 · 0 评论 -
HDU 3468 Treasure Hunting（最短路+二分图，4级）
D - Treasure HuntingTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionDo you原创 2013-10-11 21:28:57 · 809 阅读 · 0 评论 -
HDU 3360 National Treasures(KM,4级)
A - National TreasuresTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: FreeJourney (2011-08-03)System Crawler (2013-05-30)原创 2013-10-10 21:26:18 · 629 阅读 · 0 评论 -
hdu 4750 Count The Pairs(最小生成树的应用，4级)
Count The PairsTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 135 Accepted Submission(s): 66Problem Description With th原创 2013-09-21 20:57:28 · 767 阅读 · 0 评论 -
hdu 4756 Install Air Conditioning(MST+全边次小树，4级)
Install Air ConditioningTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 174 Accepted Submission(s): 23Problem Description原创 2013-09-22 11:44:31 · 1357 阅读 · 0 评论 -
uva 1423 - Guess （topsort,4级）
Given a sequence of integers, a1, a2,..., an , we define its sign matrix S such that, for 1ijn , Sij = `` + " if ai +...+ aj > 0 ; Sij = `` - " if ai +...+ aj ; and Sij = ``0" otherwise.For exa原创 2013-06-21 12:08:19 · 1052 阅读 · 0 评论 -
UVA1416 Warfare And Logistics(LA4080)（最短路，5级）
DescriptionThe army of United Nations launched a new wave of air strikes on terrorist forces. The objective of the mission is to reduce enemy's logistical mobility. Each air strike will destro原创 2013-07-07 17:25:01 · 1260 阅读 · 0 评论 -
uva 10917 Walk Through the Forest（最短路+DP路径，4级）
DescriptionProblem C: A Walk Through the ForestJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he lik原创 2013-07-07 12:04:53 · 1619 阅读 · 0 评论