AtCoder Typical Contest 001

Submission #11224727

Source codeソースコード

from collections import deque 

H,W = map(int,input().split())
c = [input() for i in range(H)]

#スタート、ゴール地点探索
for i,h in enumerate(c):
    #print(i,h)
    for j,w in enumerate(h):
        #print(j,w)
        if w == 's':
            s_h = i
            s_w = j
        if w == 'g':
            g_h = i
            g_w = j
            
#”候補スタック”作成 (スタート地点を入れておく)
todo = deque([[s_h,s_w]])
#”済みリスト”作成 (未探索(=0)、探索済み(=1))
seen = [[0]*W for i in range(H)]

#探索開始

#”候補スタック”が空っぽになるまで
while len(todo) > 0:
    #todoから探索地点を1つ取り出す
    h,w = todo.pop()
    seen[h][w] = 1
    #次に行ける地点をtodoにpushする作業
    for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
        next_h = h+i
        next_w = w+j
        if next_h < 0 or next_h >=H or next_w < 0 or next_w >= W:
            continue
        #次に行ける地点が”済みリスト”および”候補スタック”にもない場合は
        #”済みリスト”入りして、”候補スタック”にpush
        elif c[next_h][next_w] != '#' and seen[next_h][next_w] == 0 and [next_h,next_w] not in todo: 
            seen[next_h][next_w] = 1
            todo.append([next_h,next_w])

#”済みリスト”にゴール地点が含まれてるか判定
if seen[g_h][g_w] == 1:
    print('Yes')
else:
    print('No')

#探索途中で'g'が見つかった時点でprint('Yes')でもいい

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 Nary
Created time投稿日時
Language言語 Python3 (3.4.3)
Status状態 TLE
Score得点 0
Source lengthソースコード長 1584 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt
All 0 / 100 00_min_01.txt,00_min_02.txt,00_min_03.txt,00_min_04.txt,00_min_05.txt,00_min_06.txt,00_min_07.txt,00_min_08.txt,00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt,01_rnd_00.txt,01_rnd_01.txt,01_rnd_02.txt,01_rnd_03.txt,01_rnd_04.txt,01_rnd_05.txt,01_rnd_06.txt,01_rnd_07.txt,01_rnd_08.txt,01_rnd_09.txt,01_rnd_10.txt,01_rnd_11.txt,01_rnd_12.txt,01_rnd_13.txt,01_rnd_14.txt,01_rnd_15.txt,01_rnd_16.txt,01_rnd_17.txt,01_rnd_18.txt,01_rnd_19.txt,02_rndhard_00.txt,02_rndhard_01.txt,02_rndhard_02.txt,02_rndhard_03.txt,02_rndhard_04.txt,02_rndhard_05.txt,02_rndhard_06.txt,02_rndhard_07.txt,02_rndhard_08.txt,02_rndhard_09.txt,02_rndhard_10.txt,02_rndhard_11.txt,02_rndhard_12.txt,02_rndhard_13.txt,02_rndhard_14.txt,02_rndhard_15.txt,02_rndhard_16.txt,02_rndhard_17.txt,02_rndhard_18.txt,02_rndhard_19.txt,02_rndhard_20.txt,02_rndhard_21.txt,02_rndhard_22.txt,02_rndhard_23.txt,02_rndhard_24.txt,02_rndhard_25.txt,02_rndhard_26.txt,02_rndhard_27.txt,02_rndhard_28.txt,02_rndhard_29.txt,02_rndhard_30.txt,02_rndhard_31.txt,02_rndhard_32.txt,02_rndhard_33.txt,02_rndhard_34.txt,02_rndhard_35.txt,02_rndhard_36.txt,02_rndhard_37.txt,02_rndhard_38.txt,02_rndhard_39.txt,03_rndhardsmall_00.txt,03_rndhardsmall_01.txt,03_rndhardsmall_02.txt,03_rndhardsmall_03.txt,03_rndhardsmall_04.txt,03_rndhardsmall_05.txt,03_rndhardsmall_06.txt,03_rndhardsmall_07.txt,03_rndhardsmall_08.txt,03_rndhardsmall_09.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_min_01.txt AC 21 ms 3316 KB
00_min_02.txt AC 21 ms 3316 KB
00_min_03.txt AC 21 ms 3316 KB
00_min_04.txt AC 21 ms 3316 KB
00_min_05.txt AC 21 ms 3316 KB
00_min_06.txt AC 21 ms 3316 KB
00_min_07.txt AC 21 ms 3316 KB
00_min_08.txt AC 21 ms 3316 KB
00_sample_01.txt AC 21 ms 3316 KB
00_sample_02.txt AC 21 ms 3316 KB
00_sample_03.txt AC 21 ms 3316 KB
00_sample_04.txt AC 21 ms 3316 KB
00_sample_05.txt AC 21 ms 3316 KB
01_rnd_00.txt AC 60 ms 5620 KB
01_rnd_01.txt TLE
01_rnd_02.txt TLE
01_rnd_03.txt TLE
01_rnd_04.txt TLE
01_rnd_05.txt AC 63 ms 5620 KB
01_rnd_06.txt TLE
01_rnd_07.txt TLE
01_rnd_08.txt AC 65 ms 5620 KB
01_rnd_09.txt AC 60 ms 5620 KB
01_rnd_10.txt TLE
01_rnd_11.txt AC 60 ms 5620 KB
01_rnd_12.txt TLE
01_rnd_13.txt TLE
01_rnd_14.txt AC 63 ms 5620 KB
01_rnd_15.txt TLE
01_rnd_16.txt AC 62 ms 5620 KB
01_rnd_17.txt TLE
01_rnd_18.txt AC 60 ms 5620 KB
01_rnd_19.txt TLE
02_rndhard_00.txt AC 66 ms 5620 KB
02_rndhard_01.txt AC 66 ms 5620 KB
02_rndhard_02.txt AC 379 ms 5620 KB
02_rndhard_03.txt AC 347 ms 5620 KB
02_rndhard_04.txt AC 60 ms 5620 KB
02_rndhard_05.txt AC 61 ms 5620 KB
02_rndhard_06.txt AC 64 ms 5620 KB
02_rndhard_07.txt AC 70 ms 5620 KB
02_rndhard_08.txt AC 97 ms 5620 KB
02_rndhard_09.txt AC 98 ms 5620 KB
02_rndhard_10.txt AC 97 ms 7668 KB
02_rndhard_11.txt AC 98 ms 5620 KB
02_rndhard_12.txt AC 82 ms 5620 KB
02_rndhard_13.txt AC 80 ms 5620 KB
02_rndhard_14.txt AC 100 ms 5620 KB
02_rndhard_15.txt AC 99 ms 5620 KB
02_rndhard_16.txt AC 67 ms 5620 KB
02_rndhard_17.txt AC 64 ms 5620 KB
02_rndhard_18.txt AC 65 ms 5620 KB
02_rndhard_19.txt AC 65 ms 5620 KB
02_rndhard_20.txt AC 66 ms 5620 KB
02_rndhard_21.txt AC 68 ms 5620 KB
02_rndhard_22.txt AC 88 ms 5620 KB
02_rndhard_23.txt AC 79 ms 5620 KB
02_rndhard_24.txt AC 64 ms 5620 KB
02_rndhard_25.txt AC 65 ms 5620 KB
02_rndhard_26.txt AC 67 ms 5620 KB
02_rndhard_27.txt AC 61 ms 5620 KB
02_rndhard_28.txt AC 66 ms 5620 KB
02_rndhard_29.txt AC 68 ms 5620 KB
02_rndhard_30.txt AC 62 ms 5620 KB
02_rndhard_31.txt AC 68 ms 5620 KB
02_rndhard_32.txt AC 85 ms 5620 KB
02_rndhard_33.txt AC 85 ms 5620 KB
02_rndhard_34.txt AC 64 ms 5620 KB
02_rndhard_35.txt AC 65 ms 5620 KB
02_rndhard_36.txt AC 67 ms 5620 KB
02_rndhard_37.txt AC 65 ms 5620 KB
02_rndhard_38.txt AC 66 ms 5620 KB
02_rndhard_39.txt AC 67 ms 5620 KB
03_rndhardsmall_00.txt AC 21 ms 3316 KB
03_rndhardsmall_01.txt AC 21 ms 3316 KB
03_rndhardsmall_02.txt AC 21 ms 3316 KB
03_rndhardsmall_03.txt AC 21 ms 3316 KB
03_rndhardsmall_04.txt AC 21 ms 3316 KB
03_rndhardsmall_05.txt AC 21 ms 3316 KB
03_rndhardsmall_06.txt AC 21 ms 3316 KB
03_rndhardsmall_07.txt AC 21 ms 3316 KB
03_rndhardsmall_08.txt AC 21 ms 3316 KB
03_rndhardsmall_09.txt AC 21 ms 3316 KB