노트

import sys from collections import deque def bfs(v): queue = deque([v]) visited[v] = 1 while queue: target = queue.popleft() for i in graph[target]: if not visited[i]: visited[i] = visited[target] + 1 queue.append(i) n, m = map(int, sys.stdin.readline().split()) graph = [[] for _ in range(n + 1)] for i in range(m): a, b = map(int, sys.stdin.readline().split()) graph[a].append(b) graph[b].append(..