숨바꼭질[백준 6118]

https://www.acmicpc.net/problem/6118

 

 

from collections import deque 

n,m =map(int, input().split())
gra = [[] for _ in range(n+1)]

def bfs(t) :
    q = deque()
    q.append(t)
    visit[t] = 1
    while q: 
        node = q.popleft() 
        for nextnode in gra[node] :
            if visit[nextnode]==0 :
                visit[nextnode] = visit[node]+1 
                q.append(nextnode)


for _ in range(m) :
    a,b =map(int, input().split())
    gra[a].append(b)
    gra[b].append(a) 
visit = [0]*(n+1) 

bfs(1) 
ans = max(visit) 

print(visit.index(ans) , ans-1 ,visit.count(ans))