結果

問題 No.1479 Matrix Eraser
ユーザー vwxyzvwxyz
提出日時 2023-06-11 06:54:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,469 ms / 3,000 ms
コード長 5,182 bytes
コンパイル時間 561 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 164,452 KB
最終ジャッジ日時 2024-06-11 00:51:47
合計ジャッジ時間 42,542 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 459 ms
96,896 KB
testcase_01 AC 451 ms
96,896 KB
testcase_02 AC 453 ms
96,896 KB
testcase_03 AC 452 ms
96,728 KB
testcase_04 AC 457 ms
96,768 KB
testcase_05 AC 478 ms
96,768 KB
testcase_06 AC 456 ms
96,760 KB
testcase_07 AC 832 ms
105,740 KB
testcase_08 AC 913 ms
108,404 KB
testcase_09 AC 1,059 ms
110,324 KB
testcase_10 AC 1,421 ms
121,600 KB
testcase_11 AC 1,108 ms
112,204 KB
testcase_12 AC 780 ms
104,408 KB
testcase_13 AC 879 ms
107,292 KB
testcase_14 AC 775 ms
104,832 KB
testcase_15 AC 588 ms
99,320 KB
testcase_16 AC 796 ms
104,960 KB
testcase_17 AC 1,435 ms
122,872 KB
testcase_18 AC 1,428 ms
122,652 KB
testcase_19 AC 1,419 ms
123,436 KB
testcase_20 AC 1,395 ms
123,928 KB
testcase_21 AC 1,443 ms
123,220 KB
testcase_22 AC 1,433 ms
123,768 KB
testcase_23 AC 1,461 ms
122,612 KB
testcase_24 AC 1,408 ms
122,288 KB
testcase_25 AC 1,469 ms
122,320 KB
testcase_26 AC 1,419 ms
122,888 KB
testcase_27 AC 1,010 ms
125,544 KB
testcase_28 AC 988 ms
125,356 KB
testcase_29 AC 1,013 ms
125,296 KB
testcase_30 AC 989 ms
125,244 KB
testcase_31 AC 1,013 ms
126,572 KB
testcase_32 AC 790 ms
163,948 KB
testcase_33 AC 783 ms
164,452 KB
testcase_34 AC 800 ms
163,816 KB
testcase_35 AC 791 ms
164,068 KB
testcase_36 AC 758 ms
163,956 KB
testcase_37 AC 493 ms
123,264 KB
testcase_38 AC 947 ms
132,456 KB
testcase_39 AC 1,291 ms
125,856 KB
testcase_40 AC 470 ms
96,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
readline=sys.stdin.readline
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,readline().split())
A=[list(map(int,readline().split())) for h in range(H)]
M=5*10**5+1
idx=[[] for a in range(M)]
for h in range(H):
    for w in range(W):
        idx[A[h][w]].append((h,w))
ans=0
for a in range(1,M):
    idxH={h:i for i,h in enumerate(set(h for h,w in idx[a]))}
    idxW={w:i for i,w in enumerate(set(w for h,w in idx[a]))}
    leH=len(idxH)
    leW=len(idxW)
    MFG=MFGraph(leH+leW+2)
    s=0
    t=leH+leW+1
    inf=1<<60
    for i in range(leH):
        MFG.add_edge(s,i+1,1)
    for i in range(leW):
        MFG.add_edge(i+leH+1,t,1)
    for h,w in idx[a]:
        MFG.add_edge(idxH[h]+1,idxW[w]+leH+1,1)
    ans+=MFG.flow(s,t)
print(ans)
0