提出 #72574990

---

ソースコード 拡げる

import sys,bisect
from heapq import heappop, heappush
from collections import deque, Counter, defaultdict
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

H,W = mi()
S = [list(input()) for _ in range(H)]

q = deque()
q.append((0,0))
dp = [[-1]*W for _ in range(H)]
dp[0][0] = 0
while q:
    x,y = q.popleft()
    for dx,dy in [(0,1),(1,0),(0,-1),(-1,0)]:
        nx,ny = x+dx,y+dy
        if not(0<=nx<H and 0<=ny<W) or S[x][y]==S[nx][ny] or dp[nx][ny]!=-1:continue
        dp[nx][ny] = dp[x][y] + 1
        q.append((nx,ny))

print(dp[H-1][W-1])

提出情報

ジャッジ結果