코드 1 (BFS 이용) import sys from collections import deque input = sys.stdin.readline n,m,k,x = map(int, input().split()) graph = [[] for _ in range(n+1)] visited = [0]*(n+1) # 방문 기록용 for _ in range(m): s,e = map(int,input().split()) graph[s].append(e) # 단방향 그래프 def bfs(start): queue = deque([start]) visited[start] = 1 while queue: num = queue.popleft() for i in graph[num]: if not visited[i]: visite..
