ソースコード 拡げる

Copy
```from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
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)]
print(seen)
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')

```

#### 提出情報

提出日時 2019-09-12 15:36:45+0900 A - 深さ優先探索 i8nd5t Python (3.4.3) 0 1378 Byte WA 955 ms 225848 KB

#### ジャッジ結果

セット名 Sample All

 WA × 5
 WA × 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 29 ms 4080 KB
00_min_02.txt 28 ms 4076 KB
00_min_03.txt 28 ms 3956 KB
00_min_04.txt 28 ms 3952 KB
00_min_05.txt 28 ms 3952 KB
00_min_06.txt 28 ms 3952 KB
00_min_07.txt 28 ms 3948 KB
00_min_08.txt 28 ms 3948 KB
00_sample_01.txt 28 ms 3952 KB
00_sample_02.txt 28 ms 3948 KB
00_sample_03.txt 28 ms 3952 KB
00_sample_04.txt 28 ms 3952 KB
00_sample_05.txt 28 ms 3952 KB
01_rnd_00.txt 105 ms 11360 KB
01_rnd_01.txt 856 ms 185424 KB
01_rnd_02.txt 554 ms 77956 KB
01_rnd_03.txt 882 ms 225848 KB
01_rnd_04.txt 801 ms 173692 KB
01_rnd_05.txt 103 ms 11360 KB
01_rnd_06.txt 504 ms 52840 KB
01_rnd_07.txt 595 ms 85180 KB
01_rnd_08.txt 105 ms 11356 KB
01_rnd_09.txt 114 ms 11360 KB
01_rnd_10.txt 352 ms 16436 KB
01_rnd_11.txt 107 ms 11356 KB
01_rnd_12.txt 699 ms 135380 KB
01_rnd_13.txt 681 ms 132948 KB
01_rnd_14.txt 103 ms 11360 KB
01_rnd_15.txt 461 ms 35484 KB
01_rnd_16.txt 107 ms 11360 KB
01_rnd_17.txt 425 ms 27640 KB
01_rnd_18.txt 103 ms 11356 KB
01_rnd_19.txt 955 ms 216488 KB
02_rndhard_00.txt 107 ms 11356 KB
02_rndhard_01.txt 116 ms 11360 KB
02_rndhard_02.txt 162 ms 11356 KB
02_rndhard_03.txt 166 ms 11356 KB
02_rndhard_04.txt 112 ms 11360 KB
02_rndhard_05.txt 104 ms 11356 KB
02_rndhard_06.txt 115 ms 11364 KB
02_rndhard_07.txt 116 ms 11360 KB
02_rndhard_08.txt 134 ms 11364 KB
02_rndhard_09.txt 132 ms 11356 KB
02_rndhard_10.txt 118 ms 11364 KB
02_rndhard_11.txt 120 ms 11356 KB
02_rndhard_12.txt 123 ms 11356 KB
02_rndhard_13.txt 114 ms 11356 KB
02_rndhard_14.txt 132 ms 11360 KB
02_rndhard_15.txt 128 ms 11356 KB
02_rndhard_16.txt 117 ms 11356 KB
02_rndhard_17.txt 114 ms 11364 KB
02_rndhard_18.txt 116 ms 11364 KB
02_rndhard_19.txt 114 ms 11356 KB
02_rndhard_20.txt 117 ms 11360 KB
02_rndhard_21.txt 109 ms 11364 KB
02_rndhard_22.txt 124 ms 11360 KB
02_rndhard_23.txt 121 ms 11360 KB
02_rndhard_24.txt 115 ms 11356 KB
02_rndhard_25.txt 123 ms 11360 KB
02_rndhard_26.txt 115 ms 11360 KB
02_rndhard_27.txt 110 ms 11356 KB
02_rndhard_28.txt 114 ms 11356 KB
02_rndhard_29.txt 115 ms 11356 KB
02_rndhard_30.txt 112 ms 11356 KB
02_rndhard_31.txt 112 ms 11364 KB
02_rndhard_32.txt 129 ms 11360 KB
02_rndhard_33.txt 125 ms 11356 KB
02_rndhard_34.txt 113 ms 11364 KB
02_rndhard_35.txt 110 ms 11360 KB
02_rndhard_36.txt 115 ms 11360 KB
02_rndhard_37.txt 116 ms 11356 KB
02_rndhard_38.txt 124 ms 11356 KB
02_rndhard_39.txt 105 ms 11360 KB
03_rndhardsmall_00.txt 28 ms 3956 KB
03_rndhardsmall_01.txt 28 ms 3948 KB
03_rndhardsmall_02.txt 28 ms 3952 KB
03_rndhardsmall_03.txt 28 ms 4084 KB
03_rndhardsmall_04.txt 28 ms 3948 KB
03_rndhardsmall_05.txt 28 ms 3956 KB
03_rndhardsmall_06.txt 28 ms 3952 KB
03_rndhardsmall_07.txt 28 ms 3948 KB
03_rndhardsmall_08.txt 28 ms 3948 KB
03_rndhardsmall_09.txt 28 ms 3948 KB