最短路径
关注
分享
扫一扫
文章平均质量分 84
KinFungYu
前SCAU ACM校队队员
展开
-
hdu 1142 A Walk Through the Forest
A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4044 Accepted Submission(s): 1489Problem Description原创 2013-04-24 11:18:21 · 693 阅读 · 0 评论 -
poj 3114 Countries in War（缩点+最短路）
Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1932 Accepted: 607DescriptionIn the year 2050, after different attempts of the UN to mai原创 2013-08-14 23:34:48 · 764 阅读 · 0 评论 -
poj 2677 Tour（双调欧几里德旅行商问题，dp）
TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3277 Accepted: 1462DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents原创 2014-02-23 10:20:11 · 1440 阅读 · 0 评论 -
hdu 2833 WuKong（最短路 + dp）
WuKongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 366Problem DescriptionLiyuan wanted to rewrite原创 2014-02-22 22:56:53 · 1294 阅读 · 1 评论 -
poj 3268 Silver Cow Party
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10102 Accepted: 4489DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2013-06-03 15:42:48 · 615 阅读 · 0 评论 -
hdu 3631 Shortest Path（floyd插点法）
Shortest PathTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3762 Accepted Submission(s): 888Problem DescriptionWhen YY was a boy原创 2014-03-01 22:33:04 · 889 阅读 · 0 评论 -
hdu 1599 find the mincost route（无向图最小环，floyd）
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1996 Accepted Submission(s): 797Problem Description杭州有N个景区，原创 2014-03-01 21:00:03 · 970 阅读 · 0 评论 -
hdu 3873 Invade the Mars（dij变体，带限制最短路）
Invade the MarsTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 365768/165536 K (Java/Others)Total Submission(s): 1232 Accepted Submission(s): 351Problem DescriptionIt's now the原创 2014-03-04 11:50:00 · 2094 阅读 · 0 评论 -
hdu 2433 Travel（最短路径树+删边+bfs）
TravelTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1541 Accepted Submission(s): 522Problem Description One day, Tom trav原创 2014-03-06 21:25:20 · 1178 阅读 · 0 评论 -
hdu 3768 Shopping（最短路+排列组合）
ShoppingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 511 Accepted Submission(s): 165Problem DescriptionYou have just moved in原创 2014-03-13 20:45:20 · 950 阅读 · 0 评论 -
hdu 3035 War（平面图最小割）
WarTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1128 Accepted Submission(s): 301Problem DescriptionCountry X is under attack原创 2014-03-18 00:07:23 · 1034 阅读 · 1 评论 -
poj 2449 Remmarguts' Date（A*求第K短路）
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 19504 Accepted: 5319Description"Good man never makes girls wait or breaks an appointment!"原创 2014-03-26 23:11:33 · 835 阅读 · 0 评论 -
poj 3311 Hie with the Pie（floyd + 状压dp）
Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3541 Accepted: 1846DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to原创 2014-04-06 16:12:16 · 763 阅读 · 0 评论 -
poj 3613 Cow Relays（经过N条边的最短路，floyd + 二分矩阵）
Cow RelaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5028 Accepted: 2001DescriptionFor their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows h原创 2014-04-06 23:14:30 · 897 阅读 · 0 评论 -
poj 3621 Sightseeing Cows（最优比率环）
Sightseeing CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7378 Accepted: 2461DescriptionFarmer John has decided to reward his cows for their har原创 2014-04-07 22:29:10 · 803 阅读 · 0 评论 -
hdu 4034 Graph（floyd）
GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1371 Accepted Submission(s): 689Problem DescriptionEveryone knows how to原创 2013-07-29 11:00:27 · 671 阅读 · 0 评论 -
hdu 3986 Harry Potter and the Final Battle(最短路+枚举删边)
Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1741 Accepted Submission(s): 487Problem Descript原创 2013-07-28 22:23:00 · 926 阅读 · 0 评论 -
hdu 3191 How Many Paths Are There（求次短路径和次短路径条数）
How Many Paths Are ThereTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 866 Accepted Submission(s): 274Problem Description o原创 2013-07-27 22:09:45 · 936 阅读 · 0 评论 -
hdu 1217 Arbitrage
ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2949 Accepted Submission(s): 1329Problem DescriptionArbitrage is the use原创 2013-04-25 12:22:54 · 639 阅读 · 0 评论 -
poj 1125 Stockbroker Grapevine
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22726 Accepted: 12399DescriptionStockbrokers are known to overreact to rumours. You h原创 2013-04-26 09:30:21 · 563 阅读 · 0 评论 -
poj 1502 MPI Maelstrom
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3906 Accepted: 2339DescriptionBIT has recently taken delivery of their new supercomputer, a 3原创 2013-04-26 10:12:59 · 752 阅读 · 0 评论 -
poj 1860 Currency Exchange
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15718 Accepted: 5432DescriptionSeveral currency exchange points are working in our city.原创 2013-06-01 17:39:39 · 601 阅读 · 0 评论 -
poj 3259 Wormholes
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24061 Accepted: 8576DescriptionWhile exploring his many farms, Farmer John has discovered a num原创 2013-06-03 22:55:47 · 746 阅读 · 0 评论 -
poj 1797 Heavy Transportation
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 17305 Accepted: 4543DescriptionBackground Hugo Heavy is happy. After the breakdown o原创 2013-06-04 16:08:26 · 672 阅读 · 0 评论 -
poj 1178 Camelot
CamelotTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2466 Accepted: 1142DescriptionCenturies ago, King Arthur and the Knights of the Round Table used to原创 2013-06-18 16:40:31 · 914 阅读 · 0 评论 -
poj 1062 昂贵的聘礼
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30886 Accepted: 8715Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探原创 2013-06-02 22:11:07 · 626 阅读 · 0 评论 -
poj 3660 Cow Contest （有向图的传递闭包）
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6033 Accepted: 3262DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici原创 2013-07-14 21:22:52 · 820 阅读 · 0 评论 -
poj 1724 ROADS
ROADSTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9055 Accepted: 3347DescriptionN cities named with numbers 1 ... N are connected with one-way roads. E原创 2013-07-14 10:14:31 · 827 阅读 · 0 评论 -
poj 3377 Ferry Lanes（dij+heap）
Ferry LanesTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 4070 Accepted: 866DescriptionArthur lives in a small city which is partitioned into two di原创 2013-07-14 23:47:06 · 1116 阅读 · 0 评论 -
poj 1511 Invitation Cards(spfa)
Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 16148 Accepted: 5249DescriptionIn the age of television, not many people attend theater p原创 2013-06-05 14:12:52 · 876 阅读 · 0 评论 -
hdu 2544 最短路 (最短路径）
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18684 Accepted Submission(s): 7964Problem Description在每年的校赛里，所有进入决赛的同学都会获得原创 2013-04-10 19:12:01 · 697 阅读 · 0 评论 -
hdu 1385 Minimum Transport Cost(输出最短路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5466 Accepted Submission(s): 1374Problem DescriptionThe原创 2013-07-01 18:18:04 · 910 阅读 · 0 评论 -
hdu 4179 Difficult Routes（带限制最短路）
Difficult RoutesTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 748 Accepted Submission(s): 125Problem DescriptionIn preparation原创 2014-03-05 16:39:54 · 1454 阅读 · 0 评论