Submission #379079
Source Code Expand
R, C = map(int, input().split()) start = list(map(int, input().split())) goal = list(map(int, input().split())) for i in range(2): start[i] -= 1 goal[i] -= 1 maptable = [list(str(input())) for x in range(R)] que = [[start]] # up, down, right, left mx = [1, -1, 0, 0] my = [0, 0, 1, -1] count = 0 maptable[start[0]][start[1]] = '{0}'.format(count) while True: if len(que) == 0: exit(1) current = que.pop(0) count += 1 nextsearch = [] for c in current: for i in range(4): ny = c[0] + my[i] nx = c[1] + mx[i] # find out if ny == goal[0] and nx == goal[1]: print(count) exit(0) if maptable[ny][nx] == '.': nextsearch.append([ny, nx]) maptable[ny][nx] = '{0}'.format(count) que.append(nextsearch)
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | yumechi |
Language | Python (3.2.3) |
Score | 100 |
Code Size | 787 Byte |
Status | AC |
Exec Time | 147 ms |
Memory | 8612 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 | 136 ms | 8524 KB |
subtask0_sample02.txt | AC | 132 ms | 8488 KB |
subtask0_sample03.txt | AC | 147 ms | 8488 KB |
subtask1_01.txt | AC | 144 ms | 8496 KB |
subtask1_02.txt | AC | 141 ms | 8508 KB |
subtask1_03.txt | AC | 135 ms | 8492 KB |
subtask1_04.txt | AC | 143 ms | 8492 KB |
subtask1_05.txt | AC | 136 ms | 8492 KB |
subtask1_06.txt | AC | 138 ms | 8492 KB |
subtask1_07.txt | AC | 135 ms | 8488 KB |
subtask1_08.txt | AC | 138 ms | 8480 KB |
subtask1_09.txt | AC | 140 ms | 8492 KB |
subtask1_10.txt | AC | 135 ms | 8500 KB |
subtask1_11.txt | AC | 145 ms | 8476 KB |
subtask1_12.txt | AC | 140 ms | 8488 KB |
subtask1_13.txt | AC | 137 ms | 8476 KB |
subtask1_14.txt | AC | 130 ms | 8488 KB |
subtask1_15.txt | AC | 137 ms | 8492 KB |
subtask1_16.txt | AC | 137 ms | 8488 KB |
subtask1_17.txt | AC | 139 ms | 8612 KB |
subtask1_18.txt | AC | 137 ms | 8476 KB |
subtask1_19.txt | AC | 135 ms | 8492 KB |
subtask1_20.txt | AC | 138 ms | 8612 KB |
subtask1_21.txt | AC | 142 ms | 8492 KB |
subtask1_22.txt | AC | 140 ms | 8612 KB |