Submission #2546602

---

Source Code Expand

# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**6)
def inpl(): return map(int, input().split())

N, M = inpl()
G = [[] for _ in range(N+1)]
for _ in range(M):
    a, b = inpl()
    G[a].append(b)
    G[b].append(a)

searched = [False] * (N+1)

m = 1
searched[m] = True
ans = []

def dfs(c):
    searched[c] = True
    for d in G[c]:
        if not searched[d]:
            res = dfs(d)
            break
    else:
        res = []
    
    return res + [c]

L = dfs(1)
R = dfs(1)[-2::-1]

ans = L + R
print(len(ans))
print(*ans)

Submission Info

Judge Result