Submission #35122683

---

Source Code Expand

#!/usr/bin/env python3
import sys


sys.setrecursionlimit(2000000)


def main():
    def solve(p=[]):
        nonlocal flag
        if flag:
            return
        node = p[-1]
        if node == Y:
            print(" ".join([str(no) for no in p]))
            flag = True
            sys.exit()
            return
        for n in path[node]:
            if n not in visited:
                visited.add(n)
                solve(p + [n])
        return

    N, X, Y = map(int, input().split())
    flag = False
    visited = {X}
    path = [set() for _ in range(N + 1)]
    for i in range(N - 1):
        u, v = map(int, input().split())
        path[u].add(v)
        path[v].add(u)

    solve(p=[X])


if __name__ == "__main__":
    main()

Submission Info

Judge Result