提出 #60514492

---

ソースコード 拡げる

from collections import deque


h, w, d = map(int, input().split())
s = [list(input()) for _ in range(h)]

q = deque()
dists = [[-1] * w for _ in range(h)]
for i in range(h):
    for j in range(w):
        if s[i][j] == "H":
            q.append((i, j))
            dists[i][j] = 0

while q:
    i, j = q.popleft()

    for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):
        if not (0 <= ni < h and 0 <= nj < w):
            continue
        if s[ni][nj] == "#":
            continue
        if dists[ni][nj] != -1:
            continue

        dists[ni][nj] = dists[i][j] + 1
        q.append((ni, nj))

ans = 0
for i in range(h):
    for j in range(w):
        if dists[i][j] <= d and dists[i][j] != -1:
            ans += 1

print(ans)

提出情報

ジャッジ結果