코드#include #include #include #include #include using namespace std;int n, m,a,b, visited[103],res=987654321,resnum;vector adj[103];// bfsint bfs(int x) { fill(visited, visited + 103, 0); queue q; q.push(x); visited[x] = 1; while (!q.empty()) { int pn = q.front(); q.pop(); for (int i : adj[pn]) { if (!visited[i]) { visited[i] = visited[pn] + 1; q.push(i); } } } int tmp = 0; for (int..
1389번
코드 from collections import deque n,m = map(int, input().split()) friend_list = [[] for _ in range(n+1)] bacon = [] for _ in range(m): x,y = map(int, input().split()) friend_list[x].append(y) friend_list[y].append(x) def bfs(x, graph): check = [0] * (n+1) queue = deque([x]) first = x # 처음 들어온 수 기록, 첫 방문여부를 어떻게 체크해야할지 고민하다가 나온 방법 while queue: popnum = queue.popleft() for i in graph[popnum]: if not..
