随笔分类 -  图论

1 2 3 4 下一页
HDU 6201 transaction transaction transaction（拆点最长路）
摘要：transaction transaction transaction Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 88 Accepte 阅读全文
posted @ 2017-09-10 19:38 Blackops 阅读(855) 评论(0) 推荐(0)
CF 787D Legacy（线段树思想构图+最短路）
摘要：D. Legacy time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Legacy time limit per test 阅读全文
posted @ 2017-09-05 13:13 Blackops 阅读(650) 评论(0) 推荐(0)
HDU 6165 FFF at Valentine（Tarjan缩点+拓扑排序）
摘要：FFF at Valentine Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 575 Accepted Submission(s): 281 阅读全文
posted @ 2017-08-23 12:07 Blackops 阅读(287) 评论(0) 推荐(0)
HITOJ 2739 The Chinese Postman Problem（欧拉回路+最小费用流）
摘要：The Chinese Postman Problem My Tags (Edit) Source : bin3 Time limit : 1 sec Memory limit : 64 M Submitted : 503, Accepted : 172 Source : bin3 Time lim 阅读全文
posted @ 2017-08-15 19:48 Blackops 阅读(468) 评论(0) 推荐(0)
BZOJ 3876 支线剧情（有上下界的无源汇最小费用可行流）
摘要：3876: [Ahoi2014]支线剧情 Description 【故事背景】 宅男JYY非常喜欢玩RPG游戏，比如仙剑，轩辕剑等等。不过JYY喜欢的并不是战斗场景，而是类似电视剧一般的充满恩怨情仇的剧情。这些游戏往往 都有很多的支线剧情，现在JYY想花费最少的时间看完所有的支线剧情。 【问题描述】 阅读全文
posted @ 2017-07-12 15:09 Blackops 阅读(464) 评论(0) 推荐(0)
ECNU 3263 丽娃河的狼人传说（差分约束）
摘要：丽娃河的狼人传说 Time limit per test: 1.0 seconds Memory limit: 256 megabytes 丽娃河的狼人传说 Time limit per test: 1.0 seconds Memory limit: 256 megabytes Time limit 阅读全文
posted @ 2017-07-11 17:11 Blackops 阅读(337) 评论(0) 推荐(0)
POJ 3678 Katu Puzzle（2-SAT，合取范式大集合）
摘要：Katu Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9987 Accepted: 3741 Description Katu Puzzle is presented as a directed graph G( 阅读全文
posted @ 2017-07-06 20:29 Blackops 阅读(323) 评论(0) 推荐(0)
POJ 2723 Get Luffy Out（2-SAT+二分答案）
摘要：Get Luffy Out Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8851 Accepted: 3441 Description Ratish is a young man who always dreams of be 阅读全文
posted @ 2017-07-06 14:12 Blackops 阅读(234) 评论(0) 推荐(0)
POJ 3648 Wedding（2-SAT的模型运用+DFS | Tarjan）
摘要：Wedding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10427 Accepted: 3170 Special Judge Description Up to thirty couples will attend a w 阅读全文
posted @ 2017-07-05 00:56 Blackops 阅读(201) 评论(0) 推荐(0)
POJ 3683 Priest John's Busiest Day（2-SAT+方案输出）
摘要：Priest John's Busiest Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10010 Accepted: 3425 Special Judge Description John is the only p 阅读全文
posted @ 2017-07-04 12:25 Blackops 阅读(293) 评论(0) 推荐(0)
POJ 3686 The Windy's（思维+费用流好题）
摘要：The Windy's Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5362 Accepted: 2249 Description The Windy's is a world famous toy factory that 阅读全文
posted @ 2017-07-01 18:06 Blackops 阅读(360) 评论(0) 推荐(0)
POJ 2686 Traveling by Stagecoach（状压二维SPFA）
摘要：Traveling by Stagecoach Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3407 Accepted: 1322 Special Judge Description Once upon a time, the 阅读全文
posted @ 2017-06-30 19:56 Blackops 阅读(289) 评论(0) 推荐(0)
POJ 3155 Hard Life（最大密度子图+改进算法）
摘要：Hard Life Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 9012 Accepted: 2614 Case Time Limit: 2000MS Special Judge Description John is a C 阅读全文
posted @ 2017-06-13 12:25 Blackops 阅读(576) 评论(0) 推荐(0)
POJ 3621 Sightseeing Cows（最优比例环+SPFA检测）
摘要：Sightseeing Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10306 Accepted: 3519 Description Farmer John has decided to reward his cow 阅读全文
posted @ 2017-06-11 23:18 Blackops 阅读(336) 评论(0) 推荐(0)
ZOJ 2676 Network Wars（最优比例最小割）
摘要：Network of Byteland consists of n servers, connected by m optical cables. Each cable connects two servers and can transmit data in both directions. Tw 阅读全文
posted @ 2017-06-11 23:03 Blackops 阅读(283) 评论(0) 推荐(0)
HDU 5521 Meeting（虚拟节点+最短路）
摘要：Meeting Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1358 Accepted Submission(s): 435 Prob 阅读全文
posted @ 2017-06-11 12:14 Blackops 阅读(561) 评论(0) 推荐(0)
HDU 5418 Victor and World（状压DP+Floyed预处理）
摘要：Victor and World Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others) Total Submission(s): 1463 Accepted Submission(s): 阅读全文
posted @ 2017-06-03 09:34 Blackops 阅读(276) 评论(0) 推荐(0)
HDU 3395 Special Fish（拆点+最大费用最大流）
摘要：Special Fish Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2367 Accepted Submission(s): 878 Pr 阅读全文
posted @ 2017-04-07 17:26 Blackops 阅读(233) 评论(0) 推荐(0)
ZOJ 3780 Paint the Grid Again（隐式图拓扑排序）
摘要：Leo has a grid with N × N cells. He wants to paint each cell with a specific color (either black or white). Leo has a magical brush which can paint an 阅读全文
posted @ 2017-04-02 21:33 Blackops 阅读(425) 评论(0) 推荐(0)
POJ 1815 Friendship（字典序最小的最小割）
摘要：Friendship Time Limit: 2000MS Memory Limit: 20000K Total Submissions: 10744 Accepted: 2984 Description In modern society, each person has his own frie 阅读全文
posted @ 2017-03-18 13:37 Blackops 阅读(253) 评论(0) 推荐(0)

1 2 3 4 下一页