Submission #1083628

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083628		LouisCheng	Senior Postmen (BOI14_postmen)	Cpython 3	0 / 100	12 ms	2908 KiB

postmen

import sys

# sys.stdin = open("1.in", "r")

n, m = map(int, input().split())
paths = [set() for _ in range(n)]
for _ in range(m):
    a, b = map(lambda x: int(x) - 1, input().split())
    paths[a].add(b)
    paths[b].add(a)

res = []

def solve(node):
    while paths[node]:
        top = paths[node].pop()
        paths[top].remove(node)
        solve(top)
    res.append(node + 1)

solve(0)

print(*res)

• Subtask 1: 0 / 38
• Subtask 2: 0 / 17
• Subtask 3: 0 / 45