結果

問題 No.3199 Key-Door Grid
ユーザー lif4635
提出日時 2025-07-11 21:37:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,325 ms / 3,000 ms
コード長 3,410 bytes
コンパイル時間 183 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 308,304 KB
最終ジャッジ日時 2025-07-11 21:38:24
合計ジャッジ時間 19,443 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


h, w, m = MI()
s = LSI(h)

dis = [[[inf] * w for i in range(h)] for i in range(100)]
st = deque()
for i in range(h):
    for j in range(w):
        if s[i][j] == "S":
            sx = i
            sy = j
            st.append((sx, sy, 0))
            dis[0][sx][sy] = 0
        if s[i][j] == "G":
            gx = i
            gy = j
            
            

alp = DD(int)
for i in range(10):
    alp[alplow[i]] = i + 1

while st:
    x, y, idx = st.popleft()
    
    for dx, dy in DIR_4:
        nx = x + dx
        ny = y + dy
        if 0 <= nx < h and 0 <= ny < w:
            if s[nx][ny] == "#":
                continue
            elif s[nx][ny] in alp:
                if alp[s[nx][ny]] == idx:
                    nidx = idx  
                else:
                    continue
            elif s[nx][ny] in ".SG":
                nidx = idx
            else:
                nidx = int(s[nx][ny])
            
            if dis[nidx][nx][ny] > dis[idx][x][y] + 1:
                dis[nidx][nx][ny] = dis[idx][x][y] + 1
                st.append((nx,ny,nidx))

# for i in range(10):
    # print(dis[i])

ans = inf
for i in range(10):
    ans = min(ans, dis[i][gx][gy])

prinf(ans)
0