Submission #2696976
Source Code Expand
from collections import deque n, m = map(int, input().split()) start = tuple(int(x)-1 for x in input().split()) goal = tuple(int(x)-1 for x in input().split()) maze = {(i,j):c for i in range(n) for j, c in enumerate(input())} def bfs(coord): dq = deque() dq.appendleft((0, coord)) while dq: steps, (i, j) = dq.pop() if (i, j) == goal: return steps if maze.get((i, j), '#') == '#': continue maze[(i, j)] = '#' dirs = ((-1, 0), (1, 0), (0, 1), (0, -1)) dq.extendleft((steps+1, (i+di, j+dj)) for di, dj in dirs) print(bfs(start))
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | zehnpaard |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 633 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 3692 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 20 ms | 3316 KB |
subtask0_sample02.txt | AC | 21 ms | 3316 KB |
subtask0_sample03.txt | AC | 28 ms | 3692 KB |
subtask1_01.txt | AC | 24 ms | 3692 KB |
subtask1_02.txt | AC | 24 ms | 3692 KB |
subtask1_03.txt | AC | 24 ms | 3692 KB |
subtask1_04.txt | AC | 27 ms | 3692 KB |
subtask1_05.txt | AC | 24 ms | 3692 KB |
subtask1_06.txt | AC | 26 ms | 3692 KB |
subtask1_07.txt | AC | 20 ms | 3316 KB |
subtask1_08.txt | AC | 21 ms | 3692 KB |
subtask1_09.txt | AC | 24 ms | 3692 KB |
subtask1_10.txt | AC | 22 ms | 3692 KB |
subtask1_11.txt | AC | 28 ms | 3692 KB |
subtask1_12.txt | AC | 26 ms | 3692 KB |
subtask1_13.txt | AC | 25 ms | 3692 KB |
subtask1_14.txt | AC | 22 ms | 3692 KB |
subtask1_15.txt | AC | 25 ms | 3692 KB |
subtask1_16.txt | AC | 25 ms | 3692 KB |
subtask1_17.txt | AC | 26 ms | 3692 KB |
subtask1_18.txt | AC | 26 ms | 3692 KB |
subtask1_19.txt | AC | 24 ms | 3692 KB |
subtask1_20.txt | AC | 25 ms | 3692 KB |
subtask1_21.txt | AC | 26 ms | 3692 KB |
subtask1_22.txt | AC | 25 ms | 3692 KB |