Submission #2698529

Source Code Expand

from itertools import permutations

n, m = map(int, input().split())
edges = set()
for _ in range(m):
    a, b = map(int, input().split())
    edges.add((a, b))
    edges.add((b, a))

print(sum(all(move in edges for move in zip((1,)+p, p)) for p in permutations(range(2, n+1))))

Submission Info

Submission Time
Task C - One-stroke Path
User zehnpaard
Language Python (3.4.3)
Score 300
Code Size 287 Byte
Status AC
Exec Time 25 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.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 18 ms 3060 KB
sample_02.txt AC 18 ms 3060 KB
subtask_1_01.txt AC 21 ms 3060 KB
subtask_1_02.txt AC 21 ms 3060 KB
subtask_1_03.txt AC 21 ms 3060 KB
subtask_1_04.txt AC 25 ms 3060 KB
subtask_1_05.txt AC 18 ms 3060 KB
subtask_1_06.txt AC 17 ms 3060 KB
subtask_1_07.txt AC 18 ms 3060 KB
subtask_1_08.txt AC 18 ms 3060 KB
subtask_1_09.txt AC 18 ms 3060 KB
subtask_1_10.txt AC 18 ms 3060 KB
subtask_1_11.txt AC 22 ms 3060 KB
subtask_1_12.txt AC 23 ms 3060 KB
subtask_1_13.txt AC 25 ms 3060 KB