Submission #3414518
Source Code Expand
def dfs(v, n, visited, g): if False not in visited: return 1 result = 0 for i in range(n): if not g[v][i]: continue if visited[i]: continue visited[i] = True result += dfs(i, n, visited, g) visited[i] = False return result n, m = [int(i) for i in input().split()] g = [[False] * n for i in range(n)] for i in range(m): a, b = [int(i) for i in input().split()] g[a-1][b-1] = True g[b-1][a-1] = True visited = [False] * n visited[0] = True print(dfs(0, n, visited, g))
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | c2masamichi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 599 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 3064 KB |
subtask_1_02.txt | AC | 17 ms | 3064 KB |
subtask_1_03.txt | AC | 17 ms | 3064 KB |
subtask_1_04.txt | AC | 28 ms | 3064 KB |
subtask_1_05.txt | AC | 17 ms | 3064 KB |
subtask_1_06.txt | AC | 17 ms | 3064 KB |
subtask_1_07.txt | AC | 17 ms | 3064 KB |
subtask_1_08.txt | AC | 17 ms | 3064 KB |
subtask_1_09.txt | AC | 17 ms | 3064 KB |
subtask_1_10.txt | AC | 18 ms | 3064 KB |
subtask_1_11.txt | AC | 18 ms | 3064 KB |
subtask_1_12.txt | AC | 21 ms | 3064 KB |
subtask_1_13.txt | AC | 26 ms | 3064 KB |