Submission #1970997
Source Code Expand
f = lambda : map(int, input().split()) R, C = f() sy, sx = f() gy, gx = f() c = [] for i in range(R): c.append(list(input())) queue = [] j = 0 c[sy-1][sx-1] = j queue.append((sy, sx)) l = len(queue) while l > 0: #j += 1 v = queue.pop(0) #vの処理 y = v[0] x = v[1] j = c[y-1][x-1] + 1 if (y, x) == (gy, gx) : print(j-1) break if c[y-1-1][x-1] == '.': c[y-1-1][x-1] = j queue.append((y-1, x)) if c[y-1+1][x-1] == '.': c[y-1+1][x-1] = j queue.append((y+1, x)) if c[y-1][x-1-1] == '.': c[y-1][x-1-1] = j queue.append((y, x-1)) if c[y-1][x-1+1] == '.': c[y-1][x-1+1] = j queue.append((y, x+1)) l = len(queue)
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | rin1120 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 718 Byte |
Status | AC |
Exec Time | 23 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 | 18 ms | 3064 KB |
subtask0_sample03.txt | AC | 23 ms | 3064 KB |
subtask1_01.txt | AC | 20 ms | 3064 KB |
subtask1_02.txt | AC | 20 ms | 3064 KB |
subtask1_03.txt | AC | 20 ms | 3064 KB |
subtask1_04.txt | AC | 22 ms | 3064 KB |
subtask1_05.txt | AC | 20 ms | 3064 KB |
subtask1_06.txt | AC | 21 ms | 3064 KB |
subtask1_07.txt | AC | 18 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 | 21 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 | 20 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 |