提出 #69100916

---

ソースコード 拡げる

def solve():
    h, w = map(lambda s_: int(s_), input().split())
    s = [input() for _ in range(h)]

    def is_inside(x: int, y: int):
        return (0 <= x < h) and (0 <= y < w)
    dxyl = [(0, -1), (0, 1), (-1, 0), (1, 0)]
    # dxyl += [(1, 1), (1, -1), (-1, 1), (-1, -1)]
    for i in range(h):
        for j in range(w):
            if s[i][j] == ".":
                continue
            c = 0
            for di, dj in dxyl:
                ni, nj = i + di, j + dj
                if is_inside(ni, nj):
                    c += s[ni][nj] == "#"
            if c != 2 and c != 4:
                return False
    return True

case_t = 1
# case_t = int(input())
for _ in [None] * case_t:
    cond = solve()
    print("Yes" if cond else "No")

提出情報

ジャッジ結果