[S/W 문제해결 기본] 10일차 - Contact

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15B1cKAKwCFAYD&categoryId=AV15B1cKAKwCFAYD&categoryType=CODE&problemTitle=%5BS%2FW+%EB%AC%B8%EC%A0%9C%ED%95%B4%EA%B2%B0+%EA%B8%B0%EB%B3%B8%5D+10%EC%9D%BC%EC%B0%A8+-+Contact&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

def bfs(s):
    q=[s]
    while q:
        t = q.pop(0)
        for i in arr[t]:
            if visited[i] == 0:
                q.append(i)
                visited[i] = visited[t] + 1
 
for tc in range(1,11):
    n, s = map(int,input().split())
    lst = list(map(int,input().split()))
    arr = [[] for _ in range(101)]
    for i in range(0,n,2):
        arr[lst[i]].append(lst[i+1])
    visited = [0] * 101
    res=[]
    bfs(s)
    for i in range(101):
        if visited[i] == max(visited):	# 가장 깊이 들어간 것들 모두 찾기
            res.append(i)
 
    print(f'#{tc} {res[-1]}')  # 그 중 제일 뒤에 있는 거 출력(최대)