Submission #2694475

---

Source Code Expand

import numpy
import re
import math
from collections import deque, defaultdict

def main():
	"""
	テストコード実行
	:return:
	"""
	"""
	DFS(深さ優先探索) スタックでの実装
	"""
	r, c = map(int, input().split())
	sy, sx = map(int, input().split())
	gy, gx = map(int, input().split())
	sy, sx, gy, gx = sy - 1, sx - 1, gy - 1, gx - 1
	maze = []
	visited = [[-1] * c for _ in range(r)]
	visited[sy][sx] = 0
	src = [input() for _ in range(r)]
	for row in src:
		maze.append(list(row))
	queue = deque()
	queue.append((sy, sx))
	dxy = [(1, 0), (-1, 0), (0, 1), (0, -1)]
	while len(queue) > 0:
		y, x = queue.popleft()
		if y == gy and x == gx:
			print(visited[y][x])
			exit()
		for dx, dy in dxy:
			if maze[y + dy][x + dx] is "." and visited[y + dy][x + dx] == -1:
				queue.append((y + dy, x + dx))
				visited[y + dy][x + dx] = visited[y][x] + 1

if __name__ == '__main__':
	main()

Submission Info

Judge Result