Submission #2546606


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

Submission Time
Task B - Hamiltonish Path
User nadare881
Language PyPy3 (2.4.0)
Score 0
Code Size 575 Byte
Status TLE
Exec Time 2118 ms
Memory 236876 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 18
TLE × 1
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt
Case Name Status Exec Time Memory
sample_01.txt AC 167 ms 38384 KB
sample_02.txt AC 170 ms 38256 KB
sample_03.txt AC 169 ms 38256 KB
subtask_1_01.txt AC 624 ms 55708 KB
subtask_1_02.txt AC 373 ms 69976 KB
subtask_1_03.txt AC 578 ms 57380 KB
subtask_1_04.txt AC 636 ms 52828 KB
subtask_1_05.txt AC 663 ms 54876 KB
subtask_1_06.txt AC 655 ms 72668 KB
subtask_1_07.txt AC 610 ms 57760 KB
subtask_1_08.txt AC 614 ms 57248 KB
subtask_1_09.txt TLE 2118 ms 236876 KB
subtask_1_10.txt AC 401 ms 51672 KB
subtask_1_11.txt AC 435 ms 53336 KB
subtask_1_12.txt AC 168 ms 38256 KB
subtask_1_13.txt AC 168 ms 38256 KB