Submission #2401709


Source Code Expand

R, C = map(int,input().split())
s = list(map(int,input().split()))
g = list(map(int,input().split()))
s = [[i-1 for i in s]]
g = [i-1 for i in g]
v = []
for i in range(R):
    v.append(list(input()))
way = [[-1,0],[1,0],[0,-1],[0,1]]
counter = 0
prev_position = []
position = s
while True:
    counter += 1
    new_position = []
    for i,j in position:
        for i_,j_ in way:
            i_new = i + i_
            j_new = j + j_
            if i_new <= R-1 and i_new >= 0 and j_new <= C-1 and j_new >= 0:
                if [i_new,j_new] not in prev_position:
                    if [i_new,j_new] == g:
                        print(counter)
                        exit()
                    elif v[i_new][j_new] == '.':
                        new_position.append([i_new,j_new])
    prev_position = position
    position = new_position

Submission Info

Submission Time
Task C - 幅優先探索
User knsyuu
Language Python (3.4.3)
Score 0
Code Size 869 Byte
Status TLE
Exec Time 2104 ms
Memory 5620 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
TLE × 1
AC × 11
TLE × 14
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 17 ms 3064 KB
subtask0_sample02.txt AC 18 ms 3064 KB
subtask0_sample03.txt TLE 2104 ms 5620 KB
subtask1_01.txt AC 22 ms 3064 KB
subtask1_02.txt AC 21 ms 3064 KB
subtask1_03.txt AC 22 ms 3064 KB
subtask1_04.txt TLE 2104 ms 5620 KB
subtask1_05.txt TLE 2104 ms 5620 KB
subtask1_06.txt TLE 2104 ms 4724 KB
subtask1_07.txt AC 18 ms 3064 KB
subtask1_08.txt AC 18 ms 3064 KB
subtask1_09.txt TLE 2104 ms 4596 KB
subtask1_10.txt AC 347 ms 3316 KB
subtask1_11.txt TLE 2104 ms 5620 KB
subtask1_12.txt TLE 2104 ms 5108 KB
subtask1_13.txt TLE 2104 ms 4212 KB
subtask1_14.txt AC 18 ms 3064 KB
subtask1_15.txt TLE 2104 ms 4084 KB
subtask1_16.txt TLE 2104 ms 3700 KB
subtask1_17.txt TLE 2104 ms 4468 KB
subtask1_18.txt TLE 2104 ms 4596 KB
subtask1_19.txt AC 34 ms 3064 KB
subtask1_20.txt AC 98 ms 3064 KB
subtask1_21.txt TLE 2104 ms 4852 KB
subtask1_22.txt TLE 2104 ms 3700 KB