Submission #9854548


Source Code Expand

r, c = map(int, input().split())
sy, sx = map(int, input().split())
gy, gx = map(int, input().split())
maze = [list(input()) for _ in range(r)]
visited = [[False for _ in range(c)] for _ in range(r)]


def bfs(start, goal, maze, visited):
    queue = [start]
    visited[start[0]][start[1]] = True
    dist = {start: 0}
    while queue:
        y, x = queue.pop(0)
        if (y, x) == goal:
            return dist[goal]
        for move in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
            y_, x_ = y + move[0], x + move[1]
            if "." == maze[y_][x_] and not visited[y_][x_]:
                queue.append((y_, x_))
                visited[y_][x_] = True
                dist[(y_, x_)] = dist[(y, x)] + 1


print(bfs((sy-1, sx-1), (gy-1, gx-1), maze, visited))

Submission Info

Submission Time
Task A - 幅優先探索
User akio_tanaka
Language Python (3.4.3)
Score 100
Code Size 792 Byte
Status AC
Exec Time 22 ms
Memory 3316 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 25
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 17 ms 3064 KB
subtask0_sample02.txt AC 17 ms 3064 KB
subtask0_sample03.txt AC 22 ms 3316 KB
subtask1_01.txt AC 20 ms 3188 KB
subtask1_02.txt AC 20 ms 3188 KB
subtask1_03.txt AC 19 ms 3188 KB
subtask1_04.txt AC 22 ms 3316 KB
subtask1_05.txt AC 20 ms 3188 KB
subtask1_06.txt AC 21 ms 3316 KB
subtask1_07.txt AC 17 ms 3064 KB
subtask1_08.txt AC 18 ms 3064 KB
subtask1_09.txt AC 20 ms 3188 KB
subtask1_10.txt AC 18 ms 3188 KB
subtask1_11.txt AC 22 ms 3316 KB
subtask1_12.txt AC 21 ms 3316 KB
subtask1_13.txt AC 20 ms 3188 KB
subtask1_14.txt AC 18 ms 3064 KB
subtask1_15.txt AC 21 ms 3188 KB
subtask1_16.txt AC 21 ms 3188 KB
subtask1_17.txt AC 22 ms 3316 KB
subtask1_18.txt AC 21 ms 3316 KB
subtask1_19.txt AC 20 ms 3188 KB
subtask1_20.txt AC 20 ms 3188 KB
subtask1_21.txt AC 21 ms 3316 KB
subtask1_22.txt AC 20 ms 3188 KB