勇敢前进的ACMer

HDU TodayTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31489    Accepted Submission(s): 7675Problem Description经过锦囊相助，海东集团终于度

题意：n个城市，m条无向边，每个城市油价不一样。q次询问，给定起点s,终点e,求问最便宜路径。 油箱一开始设为0，假设每单位距离消耗1L汽油。分析：dijkstra变形，设d[u][fuel] 表示到达城市u剩余油量为fuel的最小花费代价。这里很多状态是无用的，不需要全部求出来，每次加油一升一升的加。代码如下：#include #include #include

题意：给定A个村庄和B个城堡，村庄编号为1到A，城堡编号为A+1到A+B，求问点1到点A+B最短路。其中可以开挂k次，每次可以瞬移最大距离为L。但有一个限制条件，瞬移经过的路径只能包含村庄。分析：先用floyd求出任意两点只经过村庄的最短路。然后用SPFA求出点1到点A+B的最短路。类似求解动规，定义 d[u][k] 表示 从起点到点u 使用k次魔法所花费的最短时间。代码如

find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3668 Accepted Submission(s): 1362Problem Description Marica

A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8954    Accepted Submission(s): 3308Problem Description

ArbitrageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8575    Accepted Submission(s): 3953Problem DescriptionArbitrage is the

Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11344    Accepted Submission(s): 3168Problem DescriptionTh

Free DIY TourTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7142 Accepted Submission(s): 2341Problem Description Weiwei is a software engi

最短路径问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29132    Accepted Submission(s): 8661Problem Description给你n个点，m条无向边，每条边都有长

题目链接：M- Walking Plan 题意：给定一个 n 个点，m 条边的有向图，q 次询问 s 到 t 经过至少 k 条边的最短路数据范围：2 ≤ n ≤ 50,1 ≤ m,k ≤ 10000,1 ≤ q ≤ 100000 思路分析：分块计算，k<=10000,把100条边缩成一条边。偷懒把题解放上来吧...  代码如下：#include ...