Submission #3459154

---

Source Code Expand

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n,m = li()
graph = [[] for _ in range(n)]
path_list = []
path_set = set()
for i in range(m):
    a,b = li_()
    graph[a].append(b)
    graph[b].append(a)
    
    if i == 0:
        st,ed = a,b
        path_list.append(a)
        path_list.append(b)
        path_set.add(a)
        path_set.add(b)

ok = False
if all([anex in path_set for anex in graph[a]]):
    ok = True

elif all([bnex in path_set for bnex in graph[b]]):
    ok = True

    
if ok:
    print(len(path_set))
    
    path_list = [pi+1 for pi in path_list]
    print(*path_list)
    

else:
    satisfied = False
    while not satisfied:
        
        for bnex in graph[ed]:
            satisfied = True
            if bnex in path_set:
                continue
            
            else:
                ed = bnex
                path_list.append(bnex)
                path_set.add(bnex)
                satisfied = False
                break

    path_list = [pi+1 for pi in path_list]
    print(len(path_set))
    print(*path_list)     

Submission Info

Judge Result