Submission #162422
Source Code Expand
r,c = map(int, raw_input().split()) sy, sx = map(int, raw_input().split()) sy, sx = sy-1, sx-1 gy, gx = map(int, raw_input().split()) g = [gy-1, gx-1] b = [raw_input() for i in range(r)] queue = [[sy,sx]] b_list = [[sy,sx]] ans = 0 nums = [[1,0],[0,1],[-1,0],[0,-1]] while not g in queue: tmp = len(queue) tmp_q = [] + queue for q in tmp_q: for n in nums: if b[q[0]+n[0]][q[1]+n[1]] == "." and not [q[0]+n[0],q[1]+n[1]] in b: queue.append([q[0]+n[0],q[1]+n[1]]) b.append([q[0]+n[0],q[1]+n[1]]) for i in range(tmp): queue.pop(0) ans += 1 print ans
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | sota1235 |
Language | Python (2.7.3) |
Score | 100 |
Code Size | 584 Byte |
Status | AC |
Exec Time | 480 ms |
Memory | 3632 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 | 95 ms | 3504 KB |
subtask0_sample02.txt | AC | 51 ms | 3504 KB |
subtask0_sample03.txt | AC | 480 ms | 3624 KB |
subtask1_01.txt | AC | 112 ms | 3516 KB |
subtask1_02.txt | AC | 113 ms | 3432 KB |
subtask1_03.txt | AC | 98 ms | 3324 KB |
subtask1_04.txt | AC | 471 ms | 3452 KB |
subtask1_05.txt | AC | 151 ms | 3448 KB |
subtask1_06.txt | AC | 251 ms | 3508 KB |
subtask1_07.txt | AC | 50 ms | 3508 KB |
subtask1_08.txt | AC | 54 ms | 3504 KB |
subtask1_09.txt | AC | 133 ms | 3328 KB |
subtask1_10.txt | AC | 59 ms | 3500 KB |
subtask1_11.txt | AC | 468 ms | 3632 KB |
subtask1_12.txt | AC | 246 ms | 3504 KB |
subtask1_13.txt | AC | 135 ms | 3500 KB |
subtask1_14.txt | AC | 50 ms | 3508 KB |
subtask1_15.txt | AC | 154 ms | 3508 KB |
subtask1_16.txt | AC | 154 ms | 3500 KB |
subtask1_17.txt | AC | 276 ms | 3632 KB |
subtask1_18.txt | AC | 202 ms | 3440 KB |
subtask1_19.txt | AC | 110 ms | 3500 KB |
subtask1_20.txt | AC | 122 ms | 3508 KB |
subtask1_21.txt | AC | 173 ms | 3436 KB |
subtask1_22.txt | AC | 120 ms | 3512 KB |