提出 #74308652

---

ソースコード 拡げる

H, W = map(int, input().split())
S = []
OK = [[False for _ in range(W)] for _ in range(H)]
for _ in range(H):
    S.append(list(input()))

ct = 0
for i in range(H):
    for j in range(W):
        if not OK[i][j]:
            OK[i][j] = True
            if S[i][j] == '.':
                ct += 1
                ct_ct = 0
                dfs = [(i, j)]
                while len(dfs) > 0:
                    h, w = dfs.pop()
                    if h == 0 or h == H - 1 or w == 0 or w == W - 1:
                        ct_ct += 1
                    if w > 0 and S[h][w - 1] == '.' and not OK[h][w - 1]:
                        OK[h][w - 1] = True
                        dfs.append((h, w - 1))
                    if h > 0 and S[h - 1][w] == '.' and not OK[h - 1][w]:
                        OK[h - 1][w] = True
                        dfs.append((h - 1, w))
                    if h < H - 1 and S[h + 1][w] == '.' and not OK[h + 1][w]:
                        OK[h + 1][w] = True
                        dfs.append((h + 1, w))
                    if w < W - 1 and S[h][w + 1] == '.' and not OK[h][w + 1]:
                        OK[h][w + 1] = True
                        dfs.append((h, w + 1))
                else:
                    if ct_ct > 0:
                        ct -= 1

print(ct)

提出情報

ジャッジ結果