提出 #74294027

---

ソースコード 拡げる

from collections import deque

h, w = map(int, input().split())
grid = []

for _ in range(h):
    grid.append(list(input()))

visited = [[False] * w for _ in range(h)]
ans = 0

for i in range(h):
    for j in range(w):
        if grid[i][j] == "." and not visited[i][j]:
            queue = deque([(i, j)])
            visited[i][j] = True
            is_surrounded = True
            
            while queue:
                r, c = queue.popleft()
                if r == 0 or r == h-1 or c == 0 or c == w-1:
                    is_surrounded = False
                
                for dr, dc in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
                    nr, nc = r + dr, c + dc
                    if 0 <= nr < h and 0 <= nc < w:
                        if grid[nr][nc] == "." and not visited[nr][nc]:
                            visited[nr][nc] = True
                            queue.append((nr, nc))
            
            if is_surrounded:
                ans += 1

print(ans)

提出情報

ジャッジ結果