随笔分类 -  图论--最短路

1 2 下一页
无向图找最小环
摘要：无向图找最小环。 阅读全文
posted @ 2017-10-19 15:07 贱人方 阅读(652) 评论(0) 推荐(0)
HDU 6071 Lazy Running （同余最短路 dij）
摘要：Lazy Running Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1384 Accepted Submission(s): 597 P 阅读全文
posted @ 2017-09-26 22:48 贱人方 阅读(287) 评论(0) 推荐(0)
HDU 6071 Lazy Running （同余最短路）
摘要：Lazy Running Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 101 Accepted Submission(s): 40 Pro 阅读全文
posted @ 2017-08-23 19:53 贱人方 阅读(199) 评论(0) 推荐(0)
Did Pong Lie? （差分系统 判负环）
摘要：Did Pong Lie? 题目描述 Doctor Pong has two arrays of integers : a1 , a2 , ......, aN and b1 , b2 , ......, bM . His student Rong wants to know what these 阅读全文
posted @ 2017-05-05 20:21 贱人方 阅读(264) 评论(0) 推荐(0)
SCU 4444 Travel （补图最短路）
摘要：Travel The country frog lives in has \(n\) towns which are conveniently numbered by \(1, 2, \dots, n\). Among \(\frac{n(n - 1)}{2}\) pairs of towns, \ 阅读全文
posted @ 2017-05-01 10:47 贱人方 阅读(530) 评论(1) 推荐(0)
POJ 3662 Telephone Lines （分层图）
摘要：Telephone Lines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6785 Accepted: 2498 Description Farmer John wants to set up a telephone lin 阅读全文
posted @ 2017-04-04 19:38 贱人方 阅读(294) 评论(0) 推荐(0)
HDU 5669 Road（线段树建树）（分层图最短路）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5669 【分析】线段树建树+分层图最短路 阅读全文
posted @ 2017-03-29 18:19 贱人方 阅读(485) 评论(0) 推荐(0)
【bzoj2763】[JLOI2011]飞行路线 （分层图最短路）（优先队列dij）
摘要：【bzoj2763】[JLOI2011]飞行路线 2014年3月25日1,7260 Description Alice和Bob现在要乘飞机旅行，他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务，设这些城市分别标记为0到n-1，一共有m种航线，每种航线连接两个城市，并且航线有一定的价 阅读全文
posted @ 2017-03-29 17:15 贱人方 阅读(254) 评论(0) 推荐(0)
Codeforces Round #406 (Div. 2) D. Legacy （线段树建图dij）
摘要：D. Legacy time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Rick and his co-workers have m 阅读全文
posted @ 2017-03-26 12:34 贱人方 阅读(494) 评论(0) 推荐(0)
（寒假集训）Roadblock（最短路）
摘要：Roadblock 时间限制: 1 Sec 内存限制: 64 MB提交: 9 解决: 5[提交][状态][讨论版] 题目描述 Every morning, FJ wakes up and walks across the farm from his house to the barn. The fa 阅读全文
posted @ 2017-01-12 20:27 贱人方 阅读(360) 评论(0) 推荐(0)
（寒假集训） Piggyback（最短路）
摘要：Piggyback 时间限制: 1 Sec 内存限制: 64 MB提交: 3 解决: 3[提交][状态][讨论版] 题目描述 Bessie and her sister Elsie graze in different fields during the day,and in the evening 阅读全文
posted @ 2017-01-10 20:28 贱人方 阅读(304) 评论(0) 推荐(0)
URAL 1085 Meeting（最短路）
摘要：Meeting Time limit: 2.0 secondMemory limit: 64 MB K friends has decided to meet in order to celebrate their victory at the programming contest. Unfort 阅读全文
posted @ 2016-11-04 12:54 贱人方 阅读(225) 评论(0) 推荐(0)
URAL 1004 Sightseeing Trip（最小环）
摘要：Sightseeing Trip Time limit: 0.5 secondMemory limit: 64 MB There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its cl 阅读全文
posted @ 2016-11-01 22:50 贱人方 阅读(389) 评论(0) 推荐(0)
URAL 1056 Computer Net（最短路）
摘要：Computer Net Time limit: 2.0 secondMemory limit: 64 MB Background Computer net is created by consecutive computer plug-up to one that has already been 阅读全文
posted @ 2016-10-29 10:52 贱人方 阅读(267) 评论(0) 推荐(0)
URAL 1072 Routing(最短路)
摘要：Routing Time limit: 1.0 secondMemory limit: 64 MB There is a TCP/IP net of several computers. It means that: Each computer has one or more net interfa 阅读全文
posted @ 2016-10-28 23:44 贱人方 阅读(198) 评论(0) 推荐(0)
URAL 2034 Caravans（变态最短路）
摘要：Caravans Time limit: 1.0 secondMemory limit: 64 MB Student Ilya often skips his classes at the university. His friends criticize him for this, but the 阅读全文
posted @ 2016-10-26 16:06 贱人方 阅读(349) 评论(0) 推荐(0)
URAL 1934 Black Spot(最短路)
摘要：Black Spot Time limit: 1.0 secondMemory limit: 64 MB Bootstrap: Jones's terrible leviathan will find you and drag the Pearl back to the depths and you 阅读全文
posted @ 2016-10-16 18:44 贱人方 阅读(315) 评论(0) 推荐(0)
POJ 3114 Countries in War（强连通）（缩点）（最短路）
摘要：Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3672 Accepted: 1057 Description In the year 2050, after different attempts 阅读全文
posted @ 2016-09-22 17:10 贱人方 阅读(713) 评论(0) 推荐(1)
HDU5889 Barricade（最短路）（网络流）
摘要：Barricade Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 604 Accepted Submission(s): 172 Problem 阅读全文
posted @ 2016-09-18 18:14 贱人方 阅读(981) 评论(1) 推荐(0)
URAL 1205 By the Underground or by Foot?（SPFA）
摘要：By the Underground or by Foot? Time limit: 1.0 secondMemory limit: 64 MB Imagine yourself in a big city. You want to get from point A to point B. To d 阅读全文
posted @ 2016-09-15 21:14 贱人方 阅读(353) 评论(0) 推荐(0)

1 2 下一页