Submission #3786062


Source Code Expand

R, C = map(int, input().split())
S = [int(x) - 1 for x in input().split()]
G = [int(x) - 1 for x in input().split()]
M = [[] for i in range(R)]
for i in range(R):
  M[i] = input()
D = [[R * C for i in range(C)] for i in range(R)]
D[S[0]][S[1]] = 0
Q = [S]
while Q:
  x, y = Q[0]
  Q.pop(0)
  if x > 0 and M[x - 1][y] != '#' and D[x][y] + 1 < D[x - 1][y]:
    D[x - 1][y] = D[x][y] + 1
    Q.append([x - 1, y])
  if y > 0 and M[x][y - 1] != '#' and D[x][y] + 1 < D[x][y - 1]:
    D[x][y - 1] = D[x][y] + 1
    Q.append([x, y - 1])
  if x < R - 1 and M[x + 1][y] != '#' and D[x][y] + 1 < D[x + 1][y]:
    D[x + 1][y] = D[x][y] + 1
    Q.append([x + 1, y])
  if y < C - 1 and M[x][y + 1] != '#' and D[x][y] + 1 < D[x][y + 1]:
    D[x][y + 1] = D[x][y] + 1
    Q.append([x, y + 1])
print(D[G[0]][G[1]])

Submission Info

Submission Time
Task C - 幅優先探索
User nooka
Language Python (3.4.3)
Score 100
Code Size 822 Byte
Status AC
Exec Time 25 ms
Memory 3188 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 18 ms 3064 KB
subtask0_sample02.txt AC 18 ms 3188 KB
subtask0_sample03.txt AC 24 ms 3188 KB
subtask1_01.txt AC 21 ms 3188 KB
subtask1_02.txt AC 21 ms 3188 KB
subtask1_03.txt AC 21 ms 3064 KB
subtask1_04.txt AC 24 ms 3188 KB
subtask1_05.txt AC 25 ms 3188 KB
subtask1_06.txt AC 23 ms 3188 KB
subtask1_07.txt AC 18 ms 3188 KB
subtask1_08.txt AC 19 ms 3188 KB
subtask1_09.txt AC 21 ms 3064 KB
subtask1_10.txt AC 19 ms 3188 KB
subtask1_11.txt AC 24 ms 3188 KB
subtask1_12.txt AC 24 ms 3188 KB
subtask1_13.txt AC 21 ms 3064 KB
subtask1_14.txt AC 18 ms 3188 KB
subtask1_15.txt AC 22 ms 3188 KB
subtask1_16.txt AC 21 ms 3188 KB
subtask1_17.txt AC 22 ms 3188 KB
subtask1_18.txt AC 22 ms 3188 KB
subtask1_19.txt AC 21 ms 3188 KB
subtask1_20.txt AC 21 ms 3188 KB
subtask1_21.txt AC 21 ms 3064 KB
subtask1_22.txt AC 21 ms 3188 KB