헌내기는 친구가 필요해 (백준)
from queue import Queue inputs = input() n, m = list(map(int, inputs.split())) count = 0 area = [] initial_state = 0 for i in range(n): row = list(input()) if 'I' in row: # 현재 위치 기록 initial_state = (i, row.index('I')) area.append(row) queue = Queue() queue.put(initial_state) visited = set() visited.add(initial_state) while not queue.empty(): x, y = queue.get() if area[x][y] == 'P': count += 1 fo..
코딩테스트
2023. 6. 27. 15:05
