http://www.lightoj.com/volume_showproblem.php?problem=1254 how can i solve this problem?please need some help;

Michael Scofield has just broken out of the prison. Now he wants to go to a certain city for his next unfinished job. As you are the only programmer on his gang, he asked your help. As you know that the fuel prices vary in the cities, you have to write a code to help Scofield that instructs him where to take the fuel and which path to choose. Assume that his car uses one unit of fuel in one unit of distance. Now he gives you the starting city s where he starts his journey with his car, the destination city t and the capacity of the fuel tank of his car c, the code should find the route that uses the cheapest fuel cost. You can assume that Scofield's car starts with an empty fuel tank.

Input Input starts with an integer T (≤ 5), denoting the number of test cases.

Each case starts with a line containing two integers n (2 ≤ n ≤ 100) and m (0 ≤ m ≤ 1000) where n denotes the number of cities and m denotes the number of roads. The next line contains n space separated integers, each lies between 1 and 100. The ith integer in this line denotes the fuel price (per unit) in the ith city. Each of the next m lines contains three integers u v w (0 ≤ u, v < n, 1 ≤ w ≤ 100, u ≠ v) denoting that there is a road between city u and v whose length is w.

The next line contains an integer q (1 ≤ q ≤ 100) denoting the number of queries by Scofield. Each of the next q lines contains the request. Each request contains three integers: c s t (1 ≤ c ≤ 100, 0 ≤ s, t < n) where c denotes the capacity of the tank, s denotes the starting city and t denotes the destination city.

Output For each case, print the case number first. Then for each query print the cheapest trip from s to t using the car with the given capacity c or 'impossible' if there is no way of getting from s to t with the given car.

Sample Input Output for Sample Input 1

5 5

10 10 20 12 13

0 1 9

0 2 8

1 2 1

1 3 11

2 3 7

2

10 0 3

20 1 4

Case 1:

170

impossible

Auto comment: topic has been updated by i_am_nothing (previous revision, new revision, compare).This problem is equal UVA 11367, but have multiple test cases. One way to solve is run dijkstra, but store two states (location, fuel). So let's consider you are in location

u, and your current fuel isd, foreach locationvadjacent touif the cost to travel fromutovisxandx<=dyou can travel tovwith fuel equald — x. Now other option is stay in cityuand take more one unit of fuel ifd + 1<=cwith costp[u].In icpc3 book, have a explained solution for this exercise in page 150.

My code from UVA 11367 goes bellow.

Please don't copy the whole problem statement. That is a copyright infringement. Please only leave a link; that is enough.