Submission #1364604
Source Code Expand
from collections import deque def main(): R, C = map(int, input().split()) SY, SX = map(int, input().split()) GY, GX = map(int, input().split()) Ci = tuple([input() for _ in range(R)]) c1 = deque([(SX - 1, SX - 1)]) c2 = [[None for i in range(C)] for j in range(R)] c2[SX-1][SY-1] = 0 while len(c1) > 0: x, y = c1.popleft() if (x, y) == (GX- 1, GY - 1): break for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)): if '.' in Ci[y+j][x+i] and c2[y+j][x+i] == None: c1.append((x+i, y+j)) c2[y+j][x+i] = c2[y][x] + 1 print(c2[y][x]) main()
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | agw02010 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 673 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 3316 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 | 20 ms | 3316 KB |
subtask0_sample02.txt | AC | 20 ms | 3316 KB |
subtask0_sample03.txt | AC | 24 ms | 3316 KB |
subtask1_01.txt | AC | 22 ms | 3316 KB |
subtask1_02.txt | AC | 22 ms | 3316 KB |
subtask1_03.txt | AC | 22 ms | 3316 KB |
subtask1_04.txt | AC | 24 ms | 3316 KB |
subtask1_05.txt | AC | 22 ms | 3316 KB |
subtask1_06.txt | AC | 23 ms | 3316 KB |
subtask1_07.txt | AC | 20 ms | 3316 KB |
subtask1_08.txt | AC | 20 ms | 3316 KB |
subtask1_09.txt | AC | 22 ms | 3316 KB |
subtask1_10.txt | AC | 21 ms | 3316 KB |
subtask1_11.txt | AC | 24 ms | 3316 KB |
subtask1_12.txt | AC | 23 ms | 3316 KB |
subtask1_13.txt | AC | 22 ms | 3316 KB |
subtask1_14.txt | AC | 20 ms | 3316 KB |
subtask1_15.txt | AC | 22 ms | 3316 KB |
subtask1_16.txt | AC | 22 ms | 3316 KB |
subtask1_17.txt | AC | 23 ms | 3316 KB |
subtask1_18.txt | AC | 23 ms | 3316 KB |
subtask1_19.txt | AC | 22 ms | 3316 KB |
subtask1_20.txt | AC | 22 ms | 3316 KB |
subtask1_21.txt | AC | 23 ms | 3316 KB |
subtask1_22.txt | AC | 22 ms | 3316 KB |