結果

問題 No.1479 Matrix Eraser
コンテスト
ユーザー tamato
提出日時 2021-04-16 21:33:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 900 ms / 3,000 ms
コード長 3,541 bytes
コンパイル時間 298 ms
コンパイル使用メモリ 82,348 KB
実行使用メモリ 166,240 KB
最終ジャッジ日時 2024-07-03 00:57:50
合計ジャッジ時間 20,022 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline
    from collections import deque

    class Dinic:
        def __init__(self, N):
            self.N = N
            self.adj = [[] for _ in range(N + 1)]
            self.lv = None
            self.progress = None
            self.inf = 1 << 60

        def add_edge(self, fr, to, cap):
            # [to, cap, rev]
            forward = [to, cap, None]
            backward = forward[2] = [fr, 0, forward]
            self.adj[fr].append(forward)
            self.adj[to].append(backward)

        def bfs(self, s, t):
            que = deque([s])
            lv = [-1] * (self.N + 1)
            lv[s] = 0
            while que:
                v = que.popleft()
                lvv = lv[v]
                for u, cap, _ in self.adj[v]:
                    if cap and lv[u] == -1:
                        que.append(u)
                        lv[u] = lvv + 1
                        if u == t:
                            break
            self.lv = lv

        def dfs(self, s, t, flow):
            st = deque([s])
            st_f = deque([flow])
            while st:
                v = st[-1]
                f = st_f[-1]
                if v == t:
                    for i in range(len(st) - 1, 0, -1):
                        p = st[i - 1]
                        edge = self.adj[p][self.progress[p] - 1]
                        edge[1] -= f
                        edge[2][1] += f
                    return f
                if self.progress[v] == len(self.adj[v]):
                    st.pop()
                    st_f.pop()
                    continue
                else:
                    adj_v = self.adj[v]
                    for i in range(self.progress[v], len(adj_v)):
                        i = self.progress[v]
                        self.progress[v] = i + 1
                        u, cap, rev = adj_v[i]
                        if not cap or self.lv[u] != self.lv[v] + 1:
                            continue
                        else:
                            st.append(u)
                            st_f.append(min(st_f[-1], cap))
                            break

        def max_flow(self, s, t):
            flow = 0
            while True:
                self.bfs(s, t)
                if self.lv[t] < 0:
                    return flow
                self.progress = [0] * (self.N + 1)
                flow_new = self.dfs(s, t, self.inf)
                while flow_new:
                    flow += flow_new
                    flow_new = self.dfs(s, t, self.inf)

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

    D = Dinic(H + W + 2)
    s = H + W + 1
    t = s + 1
    edge = [[] for _ in range(5 * 10 ** 5 + 1)]
    for h in range(H):
        for w in range(W):
            a = A[h][w]
            edge[a].append((h, w))
    ans = 0
    for a in range(5 * 10 ** 5, 0, -1):
        if edge[a]:
            if len(edge[a]) == 1:
                ans += 1
                continue
            H_set = set()
            W_set = set()
            for h, w in edge[a]:
                D.add_edge(h+1, H+w+1, 1)
                H_set.add(h)
                W_set.add(w)
            for h in H_set:
                D.add_edge(s, h+1, 1)
            for w in W_set:
                D.add_edge(H+w+1, t, 1)
            ans += D.max_flow(s, t)
            D = Dinic(H + W + 2)
    print(ans)


if __name__ == '__main__':
    main()
0