1238. [S/W 문제해결 기본] 10일차 - Contact D4 파이썬

문제링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15B1cKAKwCFAYD&categoryId=AV15B1cKAKwCFAYD&categoryType=CODE

SW Expert Academy

 

 

from collections import deque

def solution(graph, start):
    visited = list()
    queue = deque()
    queue.append((start,0))
    visited.append(start)
    howlen=list()
    while queue:
        node, count = queue.popleft()
        if node in graph:
            for i in graph[node]:
                if i not in visited:
                    visited.append(i)
                    howlen.append((i,count+1))
                    queue.append((i,count+1))
    howlen.sort(key = lambda x : (-x[1],-x[0]))
    return howlen[0][0]

for test_case in range(1,11):
    N, start = map(int,input().split())
    numlist = list(map(int,input().split()))
    graph={}
    for i in range(0,N,2):
        if numlist[i] not in graph:
            graph[numlist[i]] = [numlist[i+1]]
        else:
            graph[numlist[i]].append(numlist[i+1])

    print('#{} {}'.format(test_case, solution(graph,start)))