提出 #43142753

---

ソースコード 拡げる

## ABC308D



h, w = map(int, input().split())


chars = [[] for _ in range(h + 2)]
chars[0] = ["'" for _ in range(w+2)]
chars[-1] = ["'" for _ in range(w+2)]
# print(chars)
for i in range(h):
    chars[i+1] = list(str(input().split()))[1:-1]
    
# print(chars)

snukes = {"s":"n","n":"u","u":"k","k":"e","e":"s"}

def dfs(G, start, visited=None):

    if start == ((h-1)*1000+w-1):
        print("Yes")
        exit()
    if start in G.keys():
        if visited is None:
            visited = set()
        visited.add(start)
        for next_node in G[start]:
            dfs(G,next_node,visited)
    return visited

direction = {}
for i in range(h):
    for j in range(w):
        if chars[i+1][j+1] in snukes.keys():
            nxt = snukes[chars[i+1][j+1]]
            # print(i,j,chars[i+1][j+1],nxt)
            if chars[i+1][j+2] == nxt:
                if (i*1000+j) not in direction.keys():
                    direction[(i*1000+j)] = set()
                direction[(i*1000+j)].add((i*1000+j+1))
            if chars[i+1][j+0] == nxt:
                if (i*1000+j) not in direction.keys():
                    direction[(i*1000+j)] = set()
                direction[(i*1000+j)].add((i*1000+j-1))
            if chars[i+2][j+1] == nxt:
                if (i*1000+j) not in direction.keys():
                    direction[(i*1000+j)] = set()
                direction[(i*1000+j)].add((i*1000+1*1000+j))
            if chars[i+0][j+1] == nxt:
                if (i*1000+j) not in direction.keys():
                    direction[(i*1000+j)] = set()
                direction[(i*1000+j)].add((i*1000+1*1000+j))

# print(direction)
if direction =={}:
    print("No")
    exit()
dfs(direction, 0)

print("No")

提出情報

ジャッジ結果