Description: The experimental task
As you know s_sin is a fun not the small child P QAQ, you know he loves playing with a recently
A strategy game called the sins of a Solar Empire last year and he has mad at AI for a whole year. And now, the battle
Prelude to open.
On a planet, the planet by n*m squares which, as boss, s_sin, obstacle each square, road
The road, small strange. S_sin wants to hook boss, assuming he can Seckill boss, his task now only need to reach boss
Location. If s_sin wants to reach a square box, but have a little strange, so must kill mobs, to
Reach a square. Assume that s_sin only to the upper and lower, left, right movement of a lattice, move in 1 time units,
Kill mobs in 1 time units. Assume that s_sin is very strong, can kill all the mobs.
Calculate the s_sin arrives at the boss position at least how much time. Note: barrier to adoption.
Data input
The first input two positive integers n, m (=n < 1, m< =100), said the map with n M.
The next N lines, M char
To Search:
File list (Check if you may need any files):
emp6.txt
Download