SHOP  Shopping
The 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.
Input
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.
Output
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.
Example
Sample input: 4 3 X1S3 42X4 X1D2 5 5 S5213 2X2X5 51248 4X4X2 1445D 0 0 Sample output: 4 23
hide comments
yashwanth_58:
20160923 09:39:27
Getting TLE with DFS !!!


vaibhav goyal:
20160820 00:12:03
simply bfs just carefully apply each constraint carefully...


trinhanh13206:
20160801 06:30:04
easy BFS 

mr_bee:
20160713 12:03:36
I got NZCE at the first submission


rushikesh:
20151121 16:02:38
My first problem using Dijkstras really happy :D 

BRAIN:
20150607 04:34:52
I use dijkstra algorithm :D 

GAURAV CHANDEL:
20150414 11:49:56
good bfs problem... 

kelaseek:
20141222 09:22:04
scanf("%c",&c)


RAJDEEP GUPTA:
20120105 17:11:07
will S always appear before D in the matrix?

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