Submission #2699004


Source Code Expand

r,c = map(int, input().split())
sy,sx = map(int, input().split())
gy,gx = map(int, input().split())
maze = []
for i in range(r):
    row = input()
    r_tmp = []
    for j in range(c):
        r_tmp.append(row[j])
    maze.append(r_tmp)
maze_ans = maze

def search_next(y,x,count):
    posi = []
    if maze[y-1][x] == '.': posi.append([y-1, x]); maze_ans[y-1][x] = count;
    if maze[y][x+1] == '.': posi.append([y, x+1]); maze_ans[y][x+1] = count;
    if maze[y+1][x] == '.': posi.append([y+1, x]); maze_ans[y+1][x] = count;
    if maze[y][x-1] == '.': posi.append([y, x-1]); maze_ans[y][x-1] = count;
    return posi

count = 0
maze_ans[sy-1][sx-1] = count
posi = [[sy-1, sx-1]]
while True:
    count += 1
    new_posi = []
    for p in posi:
        new_posi += search_next(p[0], p[1], count)
    posi = new_posi
    if maze_ans[gy-1][gx-1] != '.':
        print(count)
        exit()

Submission Info

Submission Time
Task C - 幅優先探索
User uuuno
Language Python (3.4.3)
Score 100
Code Size 921 Byte
Status AC
Exec Time 21 ms
Memory 3064 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 3064 KB
subtask0_sample03.txt AC 20 ms 3064 KB
subtask1_01.txt AC 19 ms 3064 KB
subtask1_02.txt AC 20 ms 3064 KB
subtask1_03.txt AC 19 ms 3064 KB
subtask1_04.txt AC 21 ms 3064 KB
subtask1_05.txt AC 19 ms 3064 KB
subtask1_06.txt AC 20 ms 3064 KB
subtask1_07.txt AC 18 ms 3064 KB
subtask1_08.txt AC 18 ms 3064 KB
subtask1_09.txt AC 19 ms 3064 KB
subtask1_10.txt AC 18 ms 3064 KB
subtask1_11.txt AC 20 ms 3064 KB
subtask1_12.txt AC 20 ms 3064 KB
subtask1_13.txt AC 19 ms 3064 KB
subtask1_14.txt AC 18 ms 3064 KB
subtask1_15.txt AC 19 ms 3064 KB
subtask1_16.txt AC 19 ms 3064 KB
subtask1_17.txt AC 20 ms 3064 KB
subtask1_18.txt AC 20 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 20 ms 3064 KB