【最短路】
riba2534
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
单源最短路经的迪杰斯特拉算法(Dijkstra)
Dijkstra算法(单源最短路径) 单源最短路径问题,即在图中求出给定顶点到其它任一顶点的最短路径。在弄清楚如何求算单源最短路径问题之前,必须弄清楚最短路径的最优子结构性质。一.最短路径的最优子结构性质 该性质描述为:如果P(i,j)={Vi....Vk..Vs...Vj}是从顶点i到j的最短路径,k和s是这条路径上的一个中间顶点,那么P(k,s)必定是从k转载 2017-01-14 16:24:33 · 3882 阅读 · 0 评论 -
HPU1413 StarFarming(最短路,SPFA,河南省多校连萌(三))
题目:1413: StarFarming [最短路]时间限制: 1 Sec 内存限制: 128 MB提交: 303 解决: 35 统计题目描述星农(StarFarming)公司计划要给员工发路费津贴,发放的规则是这样的:1到n-1代表各个员工家的序号,n代表公司。路费津贴只发给上班的最短路与回家的最短路的总路程最长的人。该市的路建造的有些奇怪,修原创 2017-08-11 18:18:15 · 622 阅读 · 0 评论 -
URAL1004 Sightseeing Trip(Folyd求最小环,打印路径)
题目:1004. Sightseeing TripTime limit: 0.5 secondMemory limit: 64 MBThere is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many oth原创 2017-07-31 19:02:09 · 453 阅读 · 0 评论 -
HDU1224 Free DIY Tour(最短路变形,最长路打印路径,spfa)
题目:Free DIY TourTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7000 Accepted Submission(s): 2295Problem DescriptionWei原创 2017-07-19 17:14:39 · 503 阅读 · 0 评论 -
POJ3013 Big Christmas Tree(最短路径树,spfa)
题目:Big Christmas TreeTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 24383 Accepted: 5292DescriptionChristmas is coming to KCM city. Su原创 2017-07-19 14:15:28 · 421 阅读 · 0 评论 -
FZU2271 X(最短路,Folyd变形)(第七届福建省大学生程序设计竞赛)
题目: Problem 2271 XAccept: 28 Submit: 115Time Limit: 1500 mSec Memory Limit : 32768 KB Problem DescriptionX is a fully prosperous country, especially known for its complicat原创 2017-07-18 21:36:14 · 1145 阅读 · 0 评论 -
HDU1595 find the longest of the shortest(最短路,Dijkstra)
题目:find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3341 Accepted Submission(s): 1249Problem原创 2017-07-18 10:14:05 · 383 阅读 · 0 评论 -
BZOJ1003 物流运输(dp+spfa)
题目: 1003: [ZJOI2006]物流运输Time Limit: 10 Sec Memory Limit: 162 MB Submit: 8000 Solved: 3343 [Submit][Status][Discuss] Description 物流公司要把一批货物从码头A运到码头B。由于货物量比较大,需要n天才能运完。货物运输过程中一般要转 停好几个码头。物流公司通常会设原创 2017-07-17 17:37:09 · 854 阅读 · 0 评论 -
HDU1596 find the safest road(最短路变形,Dijkstra)
题目:find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12964 Accepted Submission(s): 4625Problem Descripti原创 2017-07-17 10:52:27 · 490 阅读 · 0 评论 -
HDU6181 Two Paths(次短路,路径记录,spfa,2017 HDU多校联赛 第10场)
Description You are given a undirected graph with n nodes (numbered from 1 to n) and m edges. Alice and Bob are now trying to play a game. Both of them will take different route from 1 to n (n原创 2017-08-24 22:44:20 · 720 阅读 · 0 评论 -
景驰无人驾驶 1024 编程邀请赛 A.热爱工作的蒜蒜(最短路,SPFA)
描述 众所周知,蒜蒜是一名热爱工作的好员工,他觉得时间就是金钱,做事情总是争分夺秒。 这天晚上,蒜蒜一个人去吃晚饭。不巧的是,吃完饭以后就开始下雨了,蒜蒜并没有带雨伞出来。但是蒜蒜热爱工作,工作使他快乐,他要尽快赶回去写代码。 蒜蒜的公司在中关村,中关村这边地形复杂,有很多天桥、地下通道和马路交错在一起。其中,地下通道是可以避雨的,天桥和马路都没办法避。可以把中关村抽象成为原创 2017-10-25 21:26:12 · 532 阅读 · 0 评论 -
L. Magical Girl Haze(ACM-ICPC 2018 南京赛区网络预赛,分层最短路,堆优化的dijkstra)
描述 There are NN cities in the country, and MM directional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ici. Haze is a Magical Girl that lives in City 11, she can choos...原创 2018-09-03 20:13:55 · 354 阅读 · 0 评论 -
BZOJ2763 [JLOI2011]飞行路线(分层最短路,dijkstra的堆优化)
Description Alice和Bob现在要乘飞机旅行,他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务,设这些城市分别标记为0到n-1,一共有m种航线,每种航线连接两个城市,并且航线有一定的价格。Alice和Bob现在要从一个城市沿着航线到达另一个城市,途中可以进行转机。航空公司对他们这次旅行也推出优惠,他们可以免费在最多k种航线上搭乘飞机。那么Alice和Bob这...原创 2018-09-03 19:51:15 · 326 阅读 · 0 评论 -
ZOJ3946 Highway Project(spfa,最短路变形)
描述 Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as possible. Thus, he proposed the highway ...原创 2018-04-28 17:49:05 · 366 阅读 · 0 评论 -
UVA12295 Optimal Symmetric Paths(记忆化搜索,最短路)
描述 You have a grid of n rows and n columns. Each of the unit squares contains a non-zero digit. You walk from the top-left square to the bottom-right square. Each step, you can move left, ri...原创 2018-04-07 11:03:25 · 345 阅读 · 0 评论 -
HDU4360 As long as Binbin loves Sangsang(最短路变形,SPFA)
Problem Description Binbin misses Sangsang so much. He wants to meet with Sangsang as soon as possible. Now Binbin downloads a map from ELGOOG.There are N (1<=N<=1,314) cities in the m...原创 2018-03-28 19:39:00 · 319 阅读 · 0 评论 -
CodeForces - 954D Fight Against Traffic(最短路,dijkstra)
描述 Little town Nsk consists of n junctions connected by m bidirectional roads. Each road connects two distinct junctions and no two roads connect the same pair of junctions. It is possible t...原创 2018-04-03 15:20:17 · 727 阅读 · 0 评论 -
FZU2209 老S的旅行计划(最短路,dijkstra)
Problem Description 老S在某城市生活的非常不自在,想趁着ICPC举办期间在省内转转。已知老S所在的省有N个城市,M条无向边(对于某一对结点可能出现重边)。由于省内的交通相当糟糕,通过某条边所需要花费的时间受到一天中不同时刻的影响。此外对于某一时刻(一天24小时的任意一个整点算一个时刻),从任何方向通过无向边所需要的时间相同。现在老S想请你帮他规划一下旅行路线。In...原创 2018-03-23 00:39:41 · 333 阅读 · 0 评论 -
HDU3416 Marriage Match IV(最短路,网络流,最大流,SPFA,ISAP算法)
Problem Description Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girls are in city原创 2018-01-12 16:49:10 · 427 阅读 · 1 评论 -
FZU2261 浪里个浪(最短路,spfa)(福州大学第十四届程序设计竞赛)
题目: Problem 2261 浪里个浪Accept: 42 Submit: 108Time Limit: 1500 mSec Memory Limit : 32768 KB Problem DescriptionTonyY是一个喜欢到处浪的男人,他的梦想是带着兰兰姐姐浪遍天朝的各个角落,不过在此之前,他需要做好规划。现在他的手上有一份原创 2017-07-16 23:50:27 · 1076 阅读 · 0 评论 -
NYOJ1274 信道安全(最短路,SPFA)(河南省第九届ACM省赛)
题目:信道安全时间限制:1000 ms | 内存限制:65535 KB难度:2描述Alpha 机构有自己的一套网络系统进行信息传送。情报员 A 位于节点 1,他准备将一份情报 发送给位于节点 n 的情报部门。可是由于最近国际纷争,战事不断,很多信道都有可能被遭到监 视或破坏。 经过测试分析,Alpha 情报系统获得了网络中每段信道安全可靠性的概率原创 2017-04-14 18:33:15 · 437 阅读 · 0 评论 -
POJ1502 MPI Maelstrom(dijkstra,最短路)
题目:MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9059 Accepted: 5565DescriptionBIT has recently taken delivery of their new原创 2017-03-01 20:26:19 · 365 阅读 · 0 评论 -
POJ3660 Cow Contest(Floyd,传递闭包)
题目:Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10767 Accepted: 5996DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1原创 2017-03-01 21:03:55 · 364 阅读 · 0 评论 -
POJ3259 Wormholes(找负权回路,Floyd)
题目:WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 48056 Accepted: 17754DescriptionWhile exploring his many farms, Farmer John ha原创 2017-03-01 18:57:36 · 491 阅读 · 0 评论 -
POJ1860 Currency Exchange(正权环,folyd)
题目:Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 28540 Accepted: 10657DescriptionSeveral currency exchange points are w原创 2017-02-28 20:38:00 · 423 阅读 · 0 评论 -
POJ2253 Frogger(最短路变形,floyd,Dijkstra,spfa)
题目:FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40328 Accepted: 12960DescriptionFreddy Frog is sitting on a stone in the middle原创 2017-01-17 15:42:44 · 6394 阅读 · 10 评论 -
总结一下最短路径的迪杰斯特拉算法(Dijkstra)的基本内容以及用邻接表优化
前面转了两篇博客说了一下这个迪杰斯特拉算法,现在自己尝试总结一下。先上一个百度百科的定义:迪杰斯特拉算法--------------------------------------------------------------------------------------------------------分割线-------------------------------------原创 2017-01-15 17:29:13 · 8906 阅读 · 2 评论 -
邻接表的存图与遍历模板
在这里存一发,邻接表的模板:#include #include #include #include #include #include #include #include #define mem(a,b) memset(a,b,sizeof(a))using namespace std;const int inf=1<<29;int main(){ int n,原创 2017-01-16 08:55:42 · 918 阅读 · 0 评论 -
总结一下最短路径的弗洛伊德算法(Floyd)
看了好多大牛博客,我把弗洛伊德算法在这里总结一下。弗洛伊德算法的介绍,先参考百度百科:Floyd算法再来几篇可以参考的博文:http://www.wutianqi.com/?p=1903http://www.cnblogs.com/biyeymyhjob/archive/2012/07/31/2615833.html---------------------------------原创 2017-01-15 16:15:13 · 9636 阅读 · 7 评论 -
总结一下最短路径的贝尔曼-福特算法(Bellman-Ford)及用队列优化(spfa)
关于贝尔曼福特算法:百度百科:贝尔曼-福特算法------------------------------------------------------------------------------------------------分割线--------------------------------------------------------------------------原创 2017-01-16 17:45:07 · 3114 阅读 · 0 评论 -
POJ2240 Arbitrage(floyd找正环)
题目:ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22203 Accepted: 9427DescriptionArbitrage is the use of discrepancies in curren原创 2017-03-02 19:52:42 · 425 阅读 · 0 评论 -
POJ1724 ROADS(深搜DFS,最短路,dijkstra,用优先队列优化)
题目:ROADSTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14825 Accepted: 5370DescriptionN cities named with numbers 1 ... N are connected w原创 2017-04-14 14:50:35 · 3301 阅读 · 1 评论 -
CSU1333 Funny Car Racing(最短路,SPFA)
题目:1333: Funny Car RacingSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 529 Solved: 128 DescriptionThere is a funny car racing in a ci原创 2017-04-05 18:44:38 · 410 阅读 · 0 评论 -
HDU5137 How Many Maos Does the Guanxi Worth(最短路,spfa)
题目:How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2618 Accepted Submission(s): 1019Pr原创 2017-04-28 13:30:03 · 384 阅读 · 0 评论 -
HDU4849 Wow! Such City!(最短路,Djikstra)
题目:Wow! Such City!Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1732 Accepted Submission(s): 581Problem Description原创 2017-03-31 01:50:56 · 487 阅读 · 0 评论 -
POJ1797 Heavy Transportation(dijkstra变形,spfa)
题目:Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 32753 Accepted: 8700DescriptionBackground Hugo Heavy is happy. Af原创 2017-02-22 20:07:34 · 508 阅读 · 0 评论 -
HDU1535 Invitation Cards(最短路,spfa)
题目:Invitation CardsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3898 Accepted Submission(s): 1807Problem Description原创 2017-03-17 19:27:33 · 534 阅读 · 0 评论 -
POJ2387 Til the Cows Come Home(最短路,Dijkstra算法,spfa算法,Floyd算法,深搜DFS)
题目:Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 47642 Accepted: 16216DescriptionBessie is out in the field and wa原创 2017-01-14 19:36:41 · 4049 阅读 · 1 评论 -
POJ3268 Silver Cow Party(dijkstra,spfa)
题目:Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20481 Accepted: 9382DescriptionOne cow from each of N farms (1 ≤ N ≤ 10原创 2017-02-22 21:21:19 · 411 阅读 · 0 评论 -
HDU5521 Meeting(最短路建图,堆优化的dijkstra)
Problem DescriptionBessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated hisfences they were separated into different blocks. John’s farm are divided into n blo...原创 2018-10-20 21:43:44 · 335 阅读 · 0 评论