Submission #162120

---

Source Code Expand

n,m=map(int,raw_input().split())
s=map(int,raw_input().split())
s[0] -= 1
s[1] -= 1
g=map(int,raw_input().split())
g[0] -= 1
g[1] -= 1
field=[raw_input().rstrip() for _ in xrange(n)]

d = [[99999]*m for _ in xrange(n)]

de = ((1,0),(0,1),(-1,0),(0,-1))

import Queue
q = Queue.Queue()
q.put(s)
d[s[0]][s[1]] = 0
while not q.empty():
	cur = q.get()
	for lde in de:
		nex = (cur[0] + lde[0], cur[1] + lde[1])
		if field[nex[0]][nex[1]] == '.' and d[nex[0]][nex[1]] > d[cur[0]][cur[1]] + 1:
			d[nex[0]][nex[1]] = d[cur[0]][cur[1]] + 1
			q.put(nex)
print d[g[0]][g[1]]

Submission Info

Judge Result