-
Notifications
You must be signed in to change notification settings - Fork 0
/
boj_2178.py
36 lines (29 loc) · 897 Bytes
/
boj_2178.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
# !/usr/bin/env python
# -*- coding: utf-8 -*-
# boj 2178 미로탐색
from collections import deque
n, m = map(int, input().split())
graph = []
visited = [[False for _ in range(m)] for __ in range(n)]
for i in range(n):
graph.append(list(map(int, input())))
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]
def bfs(graph, v, visited):
queue = deque([v])
visited[v[0]][v[1]] = True
while queue:
x, y = queue.popleft()
for i in range(4):
nx = x + dx[i]
ny = y + dy[i]
if nx < 0 or ny < 0 or nx > n - 1 or ny > m - 1:
continue
if graph[nx][ny] == 0:
continue
if visited[nx][ny] == False:
visited[nx][ny] = True
graph[nx][ny] = graph[x][y] + 1
queue.append((nx, ny))
return graph[n - 1][m - 1]
print(bfs(graph, (0, 0), visited))