SHOP - Shopping

no tags 

Crowd in the supermarketThe old tube screen to your computer turned out to be the cause of your chronic headaches. You therefore decide to buy one of these new flat TFT monitors. At the entrance of the computer shop you see that it is quite full with customers.

In fact, the shop is rather packed with customers and moving inside involves a certain amount of elbowing. Since you want to return home quickly to complete your half finished SPOJ tasks, you want to sidestep the crowd as much as possible. You examine the situation somewhat closer and realise that the crowding is less in some parts of the shop. Thus, there is reason for hope that you can reach your goal in due time, provided that you take the shortest way. But which way is the shortest way?

You sketch the situation on a piece of paper but even so, it is still a tricky affair. You take out your notebook from your pocket and start to write a program which will find the shortest way for you.


The first line of the input specifies the width w and height h of the shop. Neither dimension exceeds 25.

The following h lines contain w characters each. A letter X symbolises a shelf, the letter S marks your starting position, and the letter D marks the destination (i.e. the square in front of the monitors). All free squares are marked with a digit from 1 to 9, meaning the number of seconds needed to pass this square.

There are many test cases separated by an empty line. Input terminates with width and height equal 0 0.


Your program is to output the minimum number of seconds needed to reach to destination square. Each test case in a separate line. Movements can only be vertical and horizontal. Of course, all movements must take place inside the grid. There will always be a way to reach the destination.


Sample input:
4 3

5 5

0 0

Sample output:

hide comments
it_uchi: 2021-01-12 19:53:21

AC. I Improved my debugging skills w/ this.

gaur_gaur: 2020-06-06 19:33:59

simple dijkstra on grid :)

karamany_2016: 2020-04-03 16:31:12

Learned dijkstra yesterday and solved this today.
How hard is this supposed to be compared to lets say google interviews??

dhruvgheewala: 2020-04-02 23:50:28

i'm wa, acc to my code there is no path, but in question, they told that there will be always path.
so, anyone can please give me a testcase for it?

pip33eed: 2019-10-03 02:43:44


aj_254: 2019-05-17 14:25:42

ez bfs solved in two go... one studpid mistake for input format that after every testcase there is one black line
solvable in python 3

Last edit: 2019-05-17 14:29:56
shafwanur010: 2019-04-08 23:42:32

How can I return Dijkstras after I reach the destination node? getting WA, else TLE

Last edit: 2019-04-08 23:42:59
scolar_fuad: 2019-04-03 18:33:46

Wow AC in one shot just use disktra

masterchef2209: 2019-01-03 14:26:09

good question on djikstra

manishjoshi394: 2018-11-04 19:11:56

Used Dijkstra, got AC in one go! :D

Added by:MichaƂ Czuczman
Time limit:3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:Swiss Olympiad in Informatics 2004