Submission #1498752
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 i in range(R)] maze[sx-1][sy-1] = 0 que = [[sx-1, sy-1]] def BFS(gy, gx, maze , que): while True: n = que.pop(0) adjacent = [[n[0]+1,n[1]] , [n[0],n[1]-1] , [n[0]-1,n[1]] , [n[0],n[1]+1]] for aj in adjacent: if maze[aj[0]][aj[1]] == ".": maze[aj[0]][aj[1]] = maze[n[0]][n[1]] + 1 que.append([aj[0],aj[1]]) if maze[gy -1][gx-1] != ".": print(maze[gy-1][gx-1]) break BFS(gy, gx, maze, que)
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | AT274 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 738 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 3064 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 | 17 ms | 3064 KB |
subtask0_sample02.txt | AC | 17 ms | 3064 KB |
subtask0_sample03.txt | AC | 22 ms | 3064 KB |
subtask1_01.txt | AC | 20 ms | 3064 KB |
subtask1_02.txt | AC | 20 ms | 3064 KB |
subtask1_03.txt | AC | 19 ms | 3064 KB |
subtask1_04.txt | AC | 22 ms | 3064 KB |
subtask1_05.txt | AC | 19 ms | 3064 KB |
subtask1_06.txt | AC | 21 ms | 3064 KB |
subtask1_07.txt | AC | 17 ms | 3064 KB |
subtask1_08.txt | AC | 18 ms | 3064 KB |
subtask1_09.txt | AC | 20 ms | 3064 KB |
subtask1_10.txt | AC | 18 ms | 3064 KB |
subtask1_11.txt | AC | 22 ms | 3064 KB |
subtask1_12.txt | AC | 20 ms | 3064 KB |
subtask1_13.txt | AC | 20 ms | 3064 KB |
subtask1_14.txt | AC | 18 ms | 3064 KB |
subtask1_15.txt | AC | 20 ms | 3064 KB |
subtask1_16.txt | AC | 20 ms | 3064 KB |
subtask1_17.txt | AC | 21 ms | 3064 KB |
subtask1_18.txt | AC | 21 ms | 3064 KB |
subtask1_19.txt | AC | 19 ms | 3064 KB |
subtask1_20.txt | AC | 20 ms | 3064 KB |
subtask1_21.txt | AC | 20 ms | 3064 KB |
subtask1_22.txt | AC | 21 ms | 3064 KB |