ACM 图论----最短路问题
文章平均质量分 88
青山绿水之辈
奋斗青春年华
展开
-
HDU 3313 Key Vertex(BFS+BFS) 求S点到T点路径的关键点
Key VertexTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1349 Accepted Submission(s): 307Problem DescriptionYou need walking fr原创 2015-07-30 11:02:38 · 833 阅读 · 0 评论 -
HDU3986Harry Potter and the Final Battle(SPFA删边)
Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2666 Accepted Submission(s): 761Problem Descriptio原创 2015-04-12 20:57:01 · 1049 阅读 · 0 评论 -
HDU3631Shortest Path(Floyd的巧妙应用)经典
Shortest PathTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4379 Accepted Submission(s): 1029Problem DescriptionWhen YY was a bo原创 2015-04-13 19:58:04 · 1607 阅读 · 0 评论 -
HDU1688 Sightseeing(SPFA 求最短路与次短路的路径条数)可用作模板
SightseeingTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 718 Accepted Submission(s): 293Problem DescriptionTour operator Your P原创 2015-04-18 23:18:53 · 1537 阅读 · 0 评论 -
HDU2433Travel(SPFA+记录路径优化)
TravelTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1847 Accepted Submission(s): 623Problem Description One day, Tom trav原创 2015-04-18 19:41:12 · 893 阅读 · 0 评论 -
HDU2833 WuKong(floyd + dp)经典
WuKongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1429 Accepted Submission(s): 517Problem DescriptionLiyuan wanted to rewrite原创 2015-04-18 19:55:07 · 1043 阅读 · 0 评论 -
HDU1385Minimum Transport Cost(两点间最短spfa+输出字典树最小的路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8083 Accepted Submission(s): 2104Problem DescriptionThese a原创 2015-04-05 18:22:21 · 705 阅读 · 0 评论 -
HDU2807The Shortest Path(SPFA或Floyd)
The Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2648 Accepted Submission(s): 835Problem DescriptionThere are N c原创 2015-04-03 22:12:24 · 685 阅读 · 0 评论 -
HDU1839Delay Constrained Maximum Capacity Path(二分答案+SPFA)经典
Delay Constrained Maximum Capacity PathTime Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1314 Accepted Submission(s): 418Problem De原创 2015-04-01 20:33:30 · 775 阅读 · 0 评论 -
HDU3768 Shopping(状态压缩DP+spfa)旅行商问题
ShoppingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 577 Accepted Submission(s): 197Problem DescriptionYou have just moved in原创 2015-04-15 20:42:13 · 916 阅读 · 0 评论 -
HDU2377Bus Pass(spfa)
Bus PassTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 750 Accepted Submission(s): 302Problem DescriptionYou travel a lot by bu原创 2015-04-15 13:13:45 · 776 阅读 · 0 评论 -
HDU4114 Disney's FastPass(floyd+状态压缩DP)旅游问题升级(难)
Disney's FastPassTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2117 Accepted Submission(s): 564Problem DescriptionDisney's原创 2015-04-16 21:20:09 · 916 阅读 · 0 评论 -
CSU 1333: Funny Car Racing(SPFA)13年省赛题
1333: Funny Car RacingTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 482 Solved: 116[Submit][Status][Web Board]DescriptionThere is a funny car racing in a city with n junctions and m di原创 2015-08-25 21:06:24 · 1058 阅读 · 0 评论 -
HDU 3191How Many Paths Are There(TOPE排序 求次短路及条数)
How Many Paths Are ThereTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1266 Accepted Submission(s): 437Problem Description oooc原创 2015-07-18 15:07:39 · 1045 阅读 · 0 评论 -
HDU 5418 Victor and World(状态压缩路径DP或+floyd 两种方法 求 玈行商问题)经典
Victor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 174 Accepted Submission(s): 79Problem DescriptionAfter trying h原创 2015-08-22 22:26:35 · 971 阅读 · 0 评论 -
HDU2224The shortest path(双调旅行商问题)经典
The shortest pathTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 983 Accepted Submission(s): 490Problem DescriptionThere are n po原创 2015-04-09 21:37:54 · 805 阅读 · 0 评论 -
HNU 13375 Flowery Trails (最短路)
Flowery TrailsTime Limit: 50000ms, Special Time Limit:125000ms,Memory Limit:65536KBTotal submit users: 23, Accepted users:21Problem 13375 : No special judgementProblem desc原创 2015-08-09 18:36:33 · 997 阅读 · 0 评论 -
Codeforces E. President and Roads (优先队列Dijkstar + 强连通 找必最短路上的必须边(桥))经典
E. President and Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland has n cities, the capital is原创 2015-08-07 22:49:20 · 1667 阅读 · 0 评论 -
HDU 4640 Island and study-sister(状态压缩DP+路径压缩)经典 旅行商问题
Island and study-sisterTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 790 Accepted Submission(s): 273Problem DescriptionMember原创 2015-07-15 16:31:08 · 997 阅读 · 0 评论 -
CSU 1659: Graph Center(SPFA)
1659: Graph CenterTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 63 Solved: 25[Submit][Status][Web Board]DescriptionThe center of a graph is the set of all vertices of minimum eccentr原创 2015-06-22 17:32:05 · 769 阅读 · 0 评论 -
HDU1595find the longest of the shortest(SPFA,删边求最短路中的最长路)
find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2076 Accepted Submission(s): 732Problem Description原创 2015-03-31 18:50:41 · 657 阅读 · 0 评论 -
HDU1245 Saving James Bond(最短路+简单几何)
Saving James BondTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2405 Accepted Submission(s): 454Problem DescriptionThis time let原创 2015-03-29 15:04:29 · 970 阅读 · 0 评论 -
hdu3790最短路径问题 (用优先队列实现的||dijkstar)
Problem Description给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。原创 2013-09-02 20:32:59 · 1182 阅读 · 0 评论 -
hdu2112 HDU Today (最短路之dijkstra和spfa)
Problem Description经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在原创 2013-08-28 21:46:47 · 1102 阅读 · 0 评论 -
hdu2066一个人的旅行(dijkstra和spfa算法)
Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大段时原创 2013-09-02 20:24:35 · 1339 阅读 · 0 评论 -
poj2263 Heavy Cargo(dijstra 变形)
DescriptionBig Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big that the amount of cargo you can transport with it is neve原创 2013-09-22 19:56:58 · 1355 阅读 · 0 评论 -
hdu1690 Bus System (dijkstra)
Problem DescriptionBecause of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s s原创 2013-09-03 20:48:50 · 909 阅读 · 0 评论 -
hdu1869六度分离(dijkstra)
Problem Description1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说,大意是说,任何2个素不相识的人中间最多只隔着6个人,即只用6个人就可以将他们联系在一起,因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验,一直也有很多原创 2013-09-03 22:43:27 · 1173 阅读 · 0 评论 -
hdu1874畅通工程续 (dijkstra)
Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。Input本题目包含多组数据,请处理到文件结束。每组数据第一行包含原创 2013-09-02 16:56:12 · 1125 阅读 · 0 评论 -
hdu1546Idiomatic Phrases Game (dijkstra的变形)
Problem DescriptionTom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build原创 2013-09-02 18:54:09 · 1037 阅读 · 0 评论 -
hdu1548A strange lift (dijkstar)
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 if you press the button "UP" , you will go up Ki floor,i.e,you will go to th原创 2013-11-27 20:31:25 · 965 阅读 · 0 评论 -
hdu1599find the mincost route (floyd算法,相对模板而言时间优化了一半)
Problem Description杭州有N个景区,景区之间有一些双向的路来连接,现在8600想找一条旅游路线,这个路线从A点出发并且最后回到A点,假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区,而且不能重复经过同一个景区。现在8600需要你帮他找一条这样的路线,并且花费越少越好。Input第一行是2原创 2013-11-29 01:03:05 · 1379 阅读 · 0 评论 -
hdu1217Arbitrage (spfa算法)
Problem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US D原创 2013-11-29 12:29:38 · 1080 阅读 · 0 评论 -
HDU1535Invitation Cards(有向图,正向建图和反向建图各spfa一次)
Invitation CardsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2374 Accepted Submission(s): 1151Problem DescriptionIn the age o原创 2015-03-29 19:51:41 · 917 阅读 · 0 评论 -
HDU3311Dig The Wells(斯坦纳树,spfa+状态压缩DP)可作模板
Dig The WellsTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1037 Accepted Submission(s): 453Problem DescriptionYou may all know原创 2015-03-26 22:23:27 · 1752 阅读 · 0 评论 -
zoj3010The Lamp Game(状态压缩+SPFA求最大路)经典
The Lamp GameTime Limit: 2 Seconds Memory Limit: 65536 KB Little Tom likes playing games. Recently he is fond of a game called Lamp Game. The game is like this: at first, there are n lamps o原创 2014-08-16 14:15:56 · 1072 阅读 · 0 评论 -
蓝桥杯, 算法训练 最短路 (SPFA)
问题描述给定一个n个顶点,m条边的有向图(其中某些边权可能为负,但保证没有负环)。请你计算从1号点到其他点的最短路(顶点从1到n编号)。输入格式第一行两个整数n, m。接下来的m行,每行有三个整数u, v, l,表示u到v有一条长度为l的边。输出格式共n-1行,第i行表示1号点到i+1号点的最短路。样例输入3 31原创 2014-03-15 18:58:35 · 1600 阅读 · 0 评论 -
hdu1142A Walk Through the Forest(spfa+dfs+标记,题目意思要注意)
Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even n原创 2013-12-13 18:32:02 · 1516 阅读 · 0 评论 -
hdu3339In Action(经典,最短路+01背包)
Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.Nowadays,the crazy boy原创 2013-12-12 17:56:24 · 1247 阅读 · 0 评论 -
hdu1317XYZZY (SPFA处理 有环的情况)
Problem DescriptionIt has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment o原创 2013-12-07 00:08:23 · 2036 阅读 · 0 评论