2003 Canadian Computing Competition, Stage 2

Day 2, Problem 3: Cheap Gas

Every day you drive to work through the city. Gas prices have become exorbitant as of late. You've noticed that the gas prices differ throughout the city. Sometimes the cheapest gas is on the other side of the city, but you wonder if it's worth it to drive all the way there just to fill up on cheap gas. You obviously want to spend as little money on gas as possible, but you don't want to run out along the way (your gas tank has a finite size). You wonder if it's possible to calculate the minimum amount of money you need to spend to get to your office each day.

Lucky for you! You live and work in grid city. In grid city there are streets running east-west and avenues running north-south. The streets are sequentially numbered, with the avenue is numbered with 1. Residents of the city often refer to their location with a pair of numbers, including indicating the street and avenue they're at: (3,2) implies that they are at the intersection of the 3rd street and 2nd avenue.

After years of "applied experiments" you have discovered something very uncanny about the city: it takes exactly one litre of gas to move from any intersection to any neighbouring intersection (one block north, east, south, or west). It is acceptable to arrive at your office or a gas station with 0 litres of gas in your tank.

When you get to an intersection with a gas station you can choose to fill up with as much or as little gas as you'd like. You don't want to overfill the tank, though, as it would be wasted gas.

Input

Each test case begins with a line with four integers m, n, f, and k. m is the number of streets and n is the number of avenues, (1 ≤ m,n ≤ 100). f is the maximum capacity of your gas tank, in litres. Your starting location is (1,1) and your office is at (m,n). You start at (1,1) with a full tank of gas in your car.

Each of the next k lines contains three numbers: a,b,c: a and b are integers, (a,b) being the location of a gas station, and c is the price of gas at that gas station.

Output

Sample Input

2
5 5 6 2
3 3 0.8
4 2 0.5
8 12 4 2
1 2 2
7 11 4.8

Sample Output

1.00
Stranded on the shoulder

All Submissions
Best Solutions

Point Value: 20 (partial)
Time Limit: 2.00s
Memory Limit: 64M
Added: Dec 28, 2008

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

There can be multiple gas stations at the same intersection.