Submission #3042173
Source Code Expand
import queue R,C = map(int,input().split()) sy,sx = [int(x)-1 for x in input().split()] gy,gx = [int(x)-1 for x in input().split()] field = [input() for _ in range(R)] visited = [[False for _ in range(C)] for _ in range(R)] q = queue.Queue() q.put((sy,sx,0)) visited[sy][sx] = True move_x = [1,0,-1,0] move_y = [0,1,0,-1] while True: i,j,k = q.get() if (i,j) == (gy,gx): print(k) break for m in range(4): ni,nj = i+move_y[m],j+move_x[m] if field[ni][nj] == '#': continue if visited[ni][nj]: continue visited[ni][nj] = True q.put((ni,nj,k+1))
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | at_cacao_jp |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 660 Byte |
Status | AC |
Exec Time | 45 ms |
Memory | 3952 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 | 26 ms | 3952 KB |
subtask0_sample02.txt | AC | 26 ms | 3952 KB |
subtask0_sample03.txt | AC | 45 ms | 3952 KB |
subtask1_01.txt | AC | 35 ms | 3952 KB |
subtask1_02.txt | AC | 35 ms | 3952 KB |
subtask1_03.txt | AC | 34 ms | 3952 KB |
subtask1_04.txt | AC | 44 ms | 3952 KB |
subtask1_05.txt | AC | 35 ms | 3952 KB |
subtask1_06.txt | AC | 40 ms | 3952 KB |
subtask1_07.txt | AC | 26 ms | 3952 KB |
subtask1_08.txt | AC | 28 ms | 3952 KB |
subtask1_09.txt | AC | 36 ms | 3952 KB |
subtask1_10.txt | AC | 29 ms | 3952 KB |
subtask1_11.txt | AC | 45 ms | 3952 KB |
subtask1_12.txt | AC | 40 ms | 3952 KB |
subtask1_13.txt | AC | 36 ms | 3952 KB |
subtask1_14.txt | AC | 27 ms | 3952 KB |
subtask1_15.txt | AC | 37 ms | 3952 KB |
subtask1_16.txt | AC | 37 ms | 3952 KB |
subtask1_17.txt | AC | 41 ms | 3952 KB |
subtask1_18.txt | AC | 39 ms | 3952 KB |
subtask1_19.txt | AC | 35 ms | 3952 KB |
subtask1_20.txt | AC | 36 ms | 3952 KB |
subtask1_21.txt | AC | 37 ms | 3952 KB |
subtask1_22.txt | AC | 36 ms | 3952 KB |