深搜：POJ1724:ROADS

深搜：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.
  If such path does not exist, only number -1 should be written to the output.
• 样例输入

5
6
7
1 2 2 3
2 4 3 3
3 4 2 4
1 3 4 1
4 6 2 1
3 5 2 0
5 4 3 2

• 样例输出

11

解题思路

将输入的路径按照城市保存，然后从城市1开始进行深搜，找到所有能到达城市N的路径，然后找出最短的（最优）路径。
剪枝：

1. 假设当前搜索到的最优路径的长度为L，那当此时进行深度搜索时，路径长度超过L时，不必往下搜索；
2. 假设当前城市c其过路费到达t时的最短长度为L[c][t]，则当路过城市c时，如果路费为m，如果此时的路径长度已经超过了L[c][t]时，则不必向下搜索。

C++代码