#1176538 (PyPy3) No.1427 Simplified Tetris

• 問題: No.1427 Simplified Tetris
• ユーザー: yura1685
• 提出日時: 2026-08-13 09:59:24
• 言語: PyPy3 (7.3.17)
• 結果: AC
• 実行時間: 302 ms / 2,000 ms
• コード長: 6,769 bytes
• コンパイル時間: 555 ms
• コンパイル使用メモリ: 95,980 KB
• 実行使用メモリ: 96,032 KB
• 最終ジャッジ日時: 2026-08-13 09:59:35
• 合計ジャッジ時間: 9,906 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

ファイルパターン	結果
sample	AC * 4
other	AC * 37

ソースコード

from itertools import combinations
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int

    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None

    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []

    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m

    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )

    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]

    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow

    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))

        current_edge = [0] * self._n
        level = [0] * self._n

        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value

        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False

        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0

        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow

    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited

H, W = map(int, input().split())
S = [input() for _ in range(H)]

flag = False
for row in S:
    if '#' in row:
        flag = True
    elif flag:
        print('No')
        exit()
if any(row == '#' * W for row in S):
    print('No')
    exit()

R = [row for row in S if '#' in row]
K = len(R)

alp = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'

def solve(B):
    cnt = sum(row.count('#') for row in B)
    if cnt % 2:
        return None
    white = black = 0
    for i in range(H):
        for j in range(W):
            if B[i][j] == '#':
                if (i + j) % 2 == 0:
                    white += 1
                else:
                    black += 1
    if white != black:
        return None

    src = H * W
    dst = src + 1
    g = MFGraph(H * W + 2)

    E = []
    for i in range(H):
        for j in range(W):
            if B[i][j] == '.':
                continue
            v = i * W + j
            if (i + j) % 2 == 0:
                g.add_edge(src, v, 1)
                for di, dj in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                    ni, nj = i + di, j + dj
                    if 0 <= ni < H and 0 <= nj < W and B[ni][nj] == '#':
                        u = ni * W + nj
                        eid = g.add_edge(v, u, 1)
                        E.append((eid, (i, j), (ni, nj)))
            else:
                g.add_edge(v, dst, 1)
    if g.flow(src, dst) != cnt // 2:
        return None

    ans = [['.'] * W for _ in range(H)]
    k = 0
    for eid, (i, j), (ni, nj) in E:
        if g.get_edge(eid).flow:
            c = alp[k]
            k += 1
            ans[i][j] = c
            ans[ni][nj] = c
    return [''.join(row) for row in ans]

for pos in combinations(range(H), K):
    pos = set(pos)
    rem = [i for i in range(H) if i not in pos]
    for mask in range(1 << len(rem)):
        B = [''] * H
        k = 0
        for i in range(H):
            if i in pos:
                B[i] = R[k]
                k += 1
        for j, i in enumerate(rem):
            if mask >> j & 1:
                B[i] = '#' * W
            else:
                B[i] = '.' * W
        ans = solve(B)
        if ans is not None:
            print('Yes')
            print(*ans, sep='\n')
            exit()

print('No')