AtCoder Typical Contest 001

Submission #7473072

Source codeソースコード

from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
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')

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 i8nd5t
Created time投稿日時
Language言語 Python3 (3.4.3)
Status状態 RE
Score得点 0
Source lengthソースコード長 1334 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 30 ms 4072 KB
00_min_02.txt AC 29 ms 3952 KB
00_min_03.txt AC 29 ms 3944 KB
00_min_04.txt AC 29 ms 3944 KB
00_min_05.txt AC 29 ms 3944 KB
00_min_06.txt AC 29 ms 3944 KB
00_min_07.txt AC 29 ms 3952 KB
00_min_08.txt AC 29 ms 3944 KB
00_sample_01.txt AC 28 ms 3944 KB
00_sample_02.txt AC 29 ms 3948 KB
00_sample_03.txt AC 29 ms 3948 KB
00_sample_04.txt AC 29 ms 3944 KB
00_sample_05.txt AC 29 ms 3952 KB
01_rnd_00.txt AC 110 ms 6380 KB
01_rnd_01.txt RE
01_rnd_02.txt RE
01_rnd_03.txt RE
01_rnd_04.txt RE
01_rnd_05.txt AC 106 ms 6380 KB
01_rnd_06.txt RE
01_rnd_07.txt RE
01_rnd_08.txt AC 102 ms 6384 KB
01_rnd_09.txt AC 94 ms 6380 KB
01_rnd_10.txt RE
01_rnd_11.txt AC 103 ms 6376 KB
01_rnd_12.txt RE
01_rnd_13.txt RE
01_rnd_14.txt AC 98 ms 6376 KB
01_rnd_15.txt RE
01_rnd_16.txt AC 103 ms 6376 KB
01_rnd_17.txt RE
01_rnd_18.txt AC 95 ms 6376 KB
01_rnd_19.txt RE
02_rndhard_00.txt AC 109 ms 6380 KB
02_rndhard_01.txt AC 106 ms 6376 KB
02_rndhard_02.txt RE
02_rndhard_03.txt RE
02_rndhard_04.txt AC 110 ms 6376 KB
02_rndhard_05.txt AC 105 ms 6376 KB
02_rndhard_06.txt AC 106 ms 6484 KB
02_rndhard_07.txt AC 106 ms 6384 KB
02_rndhard_08.txt AC 113 ms 6760 KB
02_rndhard_09.txt AC 118 ms 6760 KB
02_rndhard_10.txt AC 112 ms 6760 KB
02_rndhard_11.txt AC 122 ms 6760 KB
02_rndhard_12.txt AC 105 ms 6632 KB
02_rndhard_13.txt AC 115 ms 6636 KB
02_rndhard_14.txt AC 111 ms 7024 KB
02_rndhard_15.txt AC 118 ms 7016 KB
02_rndhard_16.txt AC 107 ms 6376 KB
02_rndhard_17.txt AC 109 ms 6380 KB
02_rndhard_18.txt AC 99 ms 6380 KB
02_rndhard_19.txt AC 105 ms 6380 KB
02_rndhard_20.txt AC 115 ms 6508 KB
02_rndhard_21.txt AC 107 ms 6504 KB
02_rndhard_22.txt AC 105 ms 6888 KB
02_rndhard_23.txt AC 113 ms 6896 KB
02_rndhard_24.txt AC 102 ms 6380 KB
02_rndhard_25.txt AC 106 ms 6380 KB
02_rndhard_26.txt AC 107 ms 6504 KB
02_rndhard_27.txt AC 95 ms 6376 KB
02_rndhard_28.txt AC 99 ms 6376 KB
02_rndhard_29.txt AC 99 ms 6380 KB
02_rndhard_30.txt AC 96 ms 6376 KB
02_rndhard_31.txt AC 96 ms 6380 KB
02_rndhard_32.txt AC 104 ms 6620 KB
02_rndhard_33.txt AC 115 ms 6624 KB
02_rndhard_34.txt AC 108 ms 6380 KB
02_rndhard_35.txt AC 97 ms 6380 KB
02_rndhard_36.txt AC 98 ms 6380 KB
02_rndhard_37.txt AC 104 ms 6380 KB
02_rndhard_38.txt AC 110 ms 6508 KB
02_rndhard_39.txt AC 112 ms 6512 KB
03_rndhardsmall_00.txt AC 29 ms 3948 KB
03_rndhardsmall_01.txt AC 29 ms 3948 KB
03_rndhardsmall_02.txt AC 29 ms 3948 KB
03_rndhardsmall_03.txt AC 29 ms 3944 KB
03_rndhardsmall_04.txt AC 29 ms 3952 KB
03_rndhardsmall_05.txt AC 29 ms 3944 KB
03_rndhardsmall_06.txt AC 29 ms 3952 KB
03_rndhardsmall_07.txt AC 29 ms 3948 KB
03_rndhardsmall_08.txt AC 29 ms 3944 KB
03_rndhardsmall_09.txt AC 29 ms 3944 KB