[SWEA] 1219 [S/W 문제해결 응용] 4일차 - 길찾기 (파이썬 python)

 

 

문제 링크

 

 

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14geLqABQCFAYD 

SW Expert Academy

 

 

 

문제 풀이

 

 

for _ in range(10):
    tc, length = map(int, input().split())
    road = list(map(int, input().split()))
    adj = [[] for _ in range(100)]
    for i in range(length):
        adj[road[i * 2]].append(road[i * 2 + 1])
    visited = [False] * 100
    stack = [0]
    while stack:
        now = stack.pop()
        if not visited[now]:
            visited[now] = True
            for a in adj[now]:
                if not visited[a]:
                    stack.append(a)
    print("#{} {}".format(tc, 1 if visited[99] else 0))