深搜最短路径+剪枝——POJ1724：ROADS

最新推荐文章于 2021-07-28 22:11:03 发布

WaveBridge

最新推荐文章于 2021-07-28 22:11:03 发布

阅读量1.5k

点赞数

分类专栏： acm之路 dfs 文章标签： poj 深度优先搜索剪枝算法最短路径算法

本文链接：https://blog.csdn.net/wavebridge/article/details/74942098

版权

该博客介绍了如何使用深度优先搜索（DFS）配合剪枝算法解决POJ1724题目的最短路径问题。内容包括题目描述、解题思路以及AC代码。题目要求在有限金钱下，找到从城市1到城市N的最短路径。通过邻接表存储路径信息，并利用可行性剪枝和最优性剪枝优化搜索效率。

摘要由CSDN通过智能技术生成

POJ1724:ROADS

描述:

N cities named with numbers 1 … N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (expressed in the number of coins).
Bob and Alice used to live in the city 1. After noticing that Alice was cheating in the card game they liked to play, Bob broke up with her and decided to move away - to the city N. He wants to get there as quickly as possible, but he is short on cash.

We want to help Bob to find the shortest path from the city 1 to the city N that he can afford with the amount of money he has.

输入：
The first line of the input contains the integer K, 0 <= K <= 10000, maximum number of coins that Bob can spend on his way.
The second line contains the integer N, 2 <= N <= 100, the total number of cities.

The third line contains the integer R, 1 <= R <= 10000, the total number of roads.

Each of the following R lines describes one road by specifying integers S, D, L and T separated by single blank characters :

S is the source city, 1 <= S <= N
D is the destination city, 1 <= D <= N
L is the road length, 1 <= L <= 100
T is the toll (expressed in the number of coins), 0 <= T <=100

Notice that different roads may have the same source and destination cities.

输出：
The first and the only line of the output should contain the total length of the shortest path from the city 1 to the city N whose total toll is less than or equal K coins.