1953. [모의 SW 역량테스트] 탈주범 검거

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PpLlKAQ4DFAUq&categoryId=AV5PpLlKAQ4DFAUq&categoryType=CODE&problemTitle=%ED%83%88%EC%A3%BC&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

from collections import deque
dic = [[(0,1),(0,-1),(1,0),(-1,0)], [(-1,0),(1,0)], [(0,-1),(0,1)], [(-1,0),(0,1)], [(1,0),(0,1)], [(1,0),(0,-1)],[(-1,0),(0,-1)]]
def bfs(r,c):
    q= deque()
    q.append((r,c))
    visited[r][c] = 1
    while q:
        i, j = q.popleft()
        for di, dj in dic[arr[i][j]-1]:
            ni, nj = i+di, j+dj
            if 0 <= ni < n and 0 <= nj < m and visited[ni][nj] == 0 and arr[ni][nj] != 0: # 유효한 인덱스, 미방문, 해당위치에 터널이 있음
                if (-di, -dj) in dic[arr[ni][nj]-1]:  # 방향을 반전시킨게 있을 때
                    visited[ni][nj] = visited[i][j] + 1
                    q.append((ni,nj))
 
T = int(input())
for tc in range(1,T+1):
    n, m, r, c, t = map(int, input().split()) # 지하터널 n*m /맨홀위치 arr[r][c]/ 탈출시간
    arr = [list(map(int,input().split())) for _ in range(n)]
    cnt = 0
    visited = [[0]*m for _ in range(n)]
 
    bfs(r,c)
    for v in visited:
        for k in v:
            if 0< k <= t:  # 주어진 시간 내의 모든 경우의 수 누적합
                cnt += 1
    print(f'#{tc} {cnt}')