BFS&DFS_심화17) 경쟁적 전염 _ python

문제링크

https://www.acmicpc.net/problem/18405

18405번: 경쟁적 전염

코드

# 경쟁적 전염 - bfs
from collections import deque

N, K = map(int, input().split())
graph = []
virus = []
for i in range(N):
    graph.append(list(map(int, input().split())))
    for j in range(N):
        if graph[i][j] != 0:
            virus.append(((graph[i][j], i, j)))

S, X, Y = map(int, input().split())
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]

def bfs(s, X, Y):
    que = deque(virus)
    count = 0 
    while que:
        if count == s:
            break
        for _ in range(len(que)):
            prev, x, y = que.popleft()
            for i in range(4):
                nx = x + dx[i]
                ny = y + dy[i]
                if 0 <= nx < N and 0 <= ny < N:
                    if graph[nx][ny] == 0:
                        graph[nx][ny] = graph[x][y]
                        que.append((graph[nx][ny], nx, ny))
        count += 1
    return graph[X-1][Y-1]
virus.sort()
print(bfs(S, X, Y))