오답from collections import dequen = int(input())graph = [[] for _ in range(n+1)] # 0번 제외visited = [0] * (n+1)Ai = list(map(int,input().split()))for i in range(1,n+1): graph[i].append(Ai[i-1])print(graph)s = int(input())def bfs(graph, start, visited): queue = deque([start]) #시작노드 큐에 넣음 visited[start] = 1 # 방문처리 count = 1 while queue: v = queue.popleft() for i in(graph[..