Submission #1387559


Source Code Expand

# -*- coding: utf-8 -*-
n, m = map(int, input().split())
g = [[] for i in range(n)]

for _ in range(m):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    g[a].append(b)
    g[b].append(a)

def dfs(v):
    if len(v) == n:
        return 1
    ret = 0
    for u in set(g[v[-1]]) - set(v):
        ret += dfs(v + [u])
    return ret

print(dfs([0]))

Submission Info

Submission Time
Task C - One-stroke Path
User hamko
Language Python (3.4.3)
Score 300
Code Size 380 Byte
Status AC
Exec Time 31 ms
Memory 3064 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 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB
subtask_1_01.txt AC 17 ms 3060 KB
subtask_1_02.txt AC 17 ms 3060 KB
subtask_1_03.txt AC 17 ms 3060 KB
subtask_1_04.txt AC 31 ms 3064 KB
subtask_1_05.txt AC 17 ms 2940 KB
subtask_1_06.txt AC 17 ms 3060 KB
subtask_1_07.txt AC 17 ms 3060 KB
subtask_1_08.txt AC 17 ms 3060 KB
subtask_1_09.txt AC 17 ms 3060 KB
subtask_1_10.txt AC 18 ms 3060 KB
subtask_1_11.txt AC 18 ms 3064 KB
subtask_1_12.txt AC 22 ms 3060 KB
subtask_1_13.txt AC 27 ms 3060 KB