[백준][Python] 10026 적록색약 그냥 bfs 2번. 100*100이라 시간은 넉넉했다. import sys input = sys.stdin.readline from collections import deque def bfs(x,y,color): visited[x][y] = True q = deque() q.append([x,y]) while q: x,y = q.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0 practivceAlgorithm/백준 2021.09.07