提出 #7473286


ソースコード 拡げる

Copy
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

def dfs(sh,sw):
    seen[sh][sw] = True
    for dir in range(4):
        nh = sh + dy[dir]
        nw = sw + dx[dir]
        #場外のため進めない場合
        if nh < 0 or nh > h-1 or nw < 0 or nw > w-1:
            continue
        #壁のため進めない場合
        if field[nh][nw] == '#':
            continue
        #既に探索済みの場合
        if seen[nh][nw]:
            continue
        dfs(nh,nw)

# sからtまで辿りけるか(ATC001-A)

h,w = inpl()
#4方向への移動ベクトル
dx = [1,0,-1,0]
dy = [0,1,0,-1]
field = []
#訪問済みかどうか
seen = [[False for i in range(w)] for i in range(h)]
for i in range(h):
    field.append(input())
for i in range(h):
    for j in range(w):
        if field[i][j] == 's':
            sh = i
            sw = j
        if field[i][j] == 'g':
            gh = i
            gw = j 
dfs(sh,sw)

if seen[gh][gw]:
    print('Yes')
else:
    print('No')

提出情報

提出日時
問題 A - 深さ優先探索
ユーザ i8nd5t
言語 Python (3.4.3)
得点 100
コード長 1365 Byte
結果
実行時間 926 ms
メモリ 224040 KB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 100 / 100
結果
× 5
× 83
セット名 テストケース
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 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
ケース名 結果 実行時間 メモリ
00_min_01.txt 30 ms 4076 KB
00_min_02.txt 28 ms 3952 KB
00_min_03.txt 28 ms 3952 KB
00_min_04.txt 28 ms 3948 KB
00_min_05.txt 28 ms 3956 KB
00_min_06.txt 28 ms 3948 KB
00_min_07.txt 28 ms 3948 KB
00_min_08.txt 28 ms 4080 KB
00_sample_01.txt 28 ms 3948 KB
00_sample_02.txt 28 ms 3952 KB
00_sample_03.txt 28 ms 3948 KB
00_sample_04.txt 28 ms 3948 KB
00_sample_05.txt 28 ms 3948 KB
01_rnd_00.txt 110 ms 6380 KB
01_rnd_01.txt 825 ms 183616 KB
01_rnd_02.txt 534 ms 76272 KB
01_rnd_03.txt 904 ms 224040 KB
01_rnd_04.txt 827 ms 172012 KB
01_rnd_05.txt 111 ms 6384 KB
01_rnd_06.txt 493 ms 51160 KB
01_rnd_07.txt 574 ms 83372 KB
01_rnd_08.txt 100 ms 6384 KB
01_rnd_09.txt 98 ms 6384 KB
01_rnd_10.txt 353 ms 14632 KB
01_rnd_11.txt 118 ms 6388 KB
01_rnd_12.txt 696 ms 133700 KB
01_rnd_13.txt 673 ms 131140 KB
01_rnd_14.txt 105 ms 6384 KB
01_rnd_15.txt 440 ms 33808 KB
01_rnd_16.txt 120 ms 6384 KB
01_rnd_17.txt 419 ms 25964 KB
01_rnd_18.txt 106 ms 6380 KB
01_rnd_19.txt 926 ms 214800 KB
02_rndhard_00.txt 108 ms 6448 KB
02_rndhard_01.txt 107 ms 6384 KB
02_rndhard_02.txt 164 ms 8024 KB
02_rndhard_03.txt 152 ms 8024 KB
02_rndhard_04.txt 105 ms 6388 KB
02_rndhard_05.txt 109 ms 6380 KB
02_rndhard_06.txt 112 ms 6380 KB
02_rndhard_07.txt 108 ms 6380 KB
02_rndhard_08.txt 117 ms 6736 KB
02_rndhard_09.txt 110 ms 6736 KB
02_rndhard_10.txt 119 ms 6772 KB
02_rndhard_11.txt 118 ms 6768 KB
02_rndhard_12.txt 122 ms 6644 KB
02_rndhard_13.txt 115 ms 6640 KB
02_rndhard_14.txt 120 ms 7020 KB
02_rndhard_15.txt 131 ms 7024 KB
02_rndhard_16.txt 106 ms 6384 KB
02_rndhard_17.txt 106 ms 6388 KB
02_rndhard_18.txt 108 ms 6380 KB
02_rndhard_19.txt 112 ms 6380 KB
02_rndhard_20.txt 99 ms 6516 KB
02_rndhard_21.txt 102 ms 6512 KB
02_rndhard_22.txt 119 ms 6896 KB
02_rndhard_23.txt 116 ms 6892 KB
02_rndhard_24.txt 114 ms 6384 KB
02_rndhard_25.txt 109 ms 6384 KB
02_rndhard_26.txt 99 ms 6380 KB
02_rndhard_27.txt 104 ms 6384 KB
02_rndhard_28.txt 98 ms 6508 KB
02_rndhard_29.txt 109 ms 6508 KB
02_rndhard_30.txt 109 ms 6380 KB
02_rndhard_31.txt 106 ms 6384 KB
02_rndhard_32.txt 120 ms 6636 KB
02_rndhard_33.txt 115 ms 6640 KB
02_rndhard_34.txt 108 ms 6384 KB
02_rndhard_35.txt 96 ms 6380 KB
02_rndhard_36.txt 113 ms 6380 KB
02_rndhard_37.txt 105 ms 6384 KB
02_rndhard_38.txt 107 ms 6508 KB
02_rndhard_39.txt 99 ms 6516 KB
03_rndhardsmall_00.txt 28 ms 3948 KB
03_rndhardsmall_01.txt 28 ms 3956 KB
03_rndhardsmall_02.txt 28 ms 3948 KB
03_rndhardsmall_03.txt 28 ms 3948 KB
03_rndhardsmall_04.txt 28 ms 4076 KB
03_rndhardsmall_05.txt 28 ms 3952 KB
03_rndhardsmall_06.txt 28 ms 3952 KB
03_rndhardsmall_07.txt 28 ms 3952 KB
03_rndhardsmall_08.txt 28 ms 3952 KB
03_rndhardsmall_09.txt 29 ms 3952 KB