미로탐색 문제로, dfs나 bfs로 푸는 문제이다. 나는 bfs를 이용하여 문제를 해결하였다. 처음 내 코드 from collections import deque a,b = map(int,input().split()) visit = [[0]*b for _ in range(a)] for i in range(a): c = input() for j in range(b): visit[i][j] = int(c[j]) print(visit) #BFS queue = deque() dx = [-1,1,0,0] dy = [0,0,-1,1] length=0 for i in range(a): for j in range(b): if visit[i][j]==1: visit[i][j]=0 queue.append([i,j]) le..

import sys from collections import deque a,b,c = map(int,input().split()) visit = [[0]*b for _ in range(a)] dx=[0,0,1,-1] dy=[1,-1,0,0] # visit = [[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]] for i in range(c): x1,y1,x2,y2 = map(int,input().split()) for i in range(y1,y2,1): for j in range(x1,x2,1): visit[i][j]=1 queue = deque(..