Submission #691260
Source Code Expand
from collections import deque inputs = lambda: map(int, raw_input().split()) r, c = inputs() sy, sx = inputs() gy, gx = inputs() sy -= 1; sx -= 1 gy -= 1; gx -= 1 m = [raw_input() for i in xrange(r)] dist = [[-1]*c for i in xrange(r)] deq = deque() deq.append((sy, sx)) dist[sy][sx] = 0 dx = [-1, 0, 1, 0] dy = [0, -1, 0, 1] while deq: y, x = deq.popleft() for k in xrange(4): ny = y + dy[k] nx = x + dx[k] if m[ny][nx] == '.' and dist[ny][nx] == -1: dist[ny][nx] = dist[y][x] + 1 deq.append((ny, nx)) if ny == gy and nx == gx: print dist[gy][gx] exit(0)
Submission Info
Submission Time | |
---|---|
Task | A - 幅優先探索 |
User | yaketake08 |
Language | Python (2.7.6) |
Score | 100 |
Code Size | 696 Byte |
Status | AC |
Exec Time | 1011 ms |
Memory | 3832 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 | 1011 ms | 3832 KB |
subtask0_sample02.txt | AC | 27 ms | 2808 KB |
subtask0_sample03.txt | AC | 34 ms | 2808 KB |
subtask1_01.txt | AC | 31 ms | 2808 KB |
subtask1_02.txt | AC | 31 ms | 2808 KB |
subtask1_03.txt | AC | 31 ms | 2808 KB |
subtask1_04.txt | AC | 35 ms | 2808 KB |
subtask1_05.txt | AC | 31 ms | 2808 KB |
subtask1_06.txt | AC | 32 ms | 2808 KB |
subtask1_07.txt | AC | 27 ms | 2808 KB |
subtask1_08.txt | AC | 27 ms | 2808 KB |
subtask1_09.txt | AC | 31 ms | 2808 KB |
subtask1_10.txt | AC | 28 ms | 2808 KB |
subtask1_11.txt | AC | 34 ms | 2808 KB |
subtask1_12.txt | AC | 33 ms | 2808 KB |
subtask1_13.txt | AC | 31 ms | 2808 KB |
subtask1_14.txt | AC | 27 ms | 2808 KB |
subtask1_15.txt | AC | 31 ms | 2808 KB |
subtask1_16.txt | AC | 31 ms | 2808 KB |
subtask1_17.txt | AC | 33 ms | 2808 KB |
subtask1_18.txt | AC | 32 ms | 2808 KB |
subtask1_19.txt | AC | 30 ms | 2808 KB |
subtask1_20.txt | AC | 31 ms | 2808 KB |
subtask1_21.txt | AC | 32 ms | 2808 KB |
subtask1_22.txt | AC | 31 ms | 2808 KB |