結果

問題 No.1479 Matrix Eraser
コンテスト
ユーザー tcltk
提出日時 2021-06-28 02:56:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 998 ms / 3,000 ms
コード長 3,104 bytes
コンパイル時間 464 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 151,600 KB
最終ジャッジ日時 2024-06-25 11:58:41
合計ジャッジ時間 25,661 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


sys.setrecursionlimit(1000000)

# _INPUT = """10 10
# 1 10 10 10 10 7 6 5 10 1
# 6 7 10 5 10 10 2 10 2 8
# 5 6 6 5 7 3 10 10 1 10
# 6 5 3 10 3 7 2 5 2 7
# 3 3 2 2 9 1 10 6 7 7
# 7 9 10 2 1 6 6 1 9 6
# 5 6 10 3 3 9 6 5 3 1
# 8 6 1 7 5 7 9 7 3 6
# 4 5 9 4 7 6 1 1 5 4
# 2 4 1 10 7 5 9 10 1 2

# """
# sys.stdin = io.StringIO(_INPUT)


class Dinic:
    def __init__(self, n):
        self.n = n
        self.links = [[] for _ in range(n)]
        self.depth = None
        self.progress = None
 
    def add_link(self, _from, to, cap):
        self.links[_from].append([cap, to, len(self.links[to])])
        self.links[to].append([0, _from, len(self.links[_from]) - 1])
 
    def bfs(self, s):
        depth = [-1] * self.n
        depth[s] = 0
        q = collections.deque([s])
        while q:
            v = q.popleft()
            for cap, to, rev in self.links[v]:
                if cap > 0 and depth[to] < 0:
                    depth[to] = depth[v] + 1
                    q.append(to)
        self.depth = depth
 
    def dfs(self, v, t, flow):
        if v == t:
            return flow
        links_v = self.links[v]
        for i in range(self.progress[v], len(links_v)):
            self.progress[v] = i
            cap, to, rev = link = links_v[i]
            if cap == 0 or self.depth[v] >= self.depth[to]:
                continue
            d = self.dfs(to, t, min(flow, cap))
            if d == 0:
                continue
            link[0] -= d
            self.links[to][rev][0] += d
            return d
        return 0
 
    def max_flow(self, s, t):
        flow = 0
        while True:
            self.bfs(s)
            if self.depth[t] < 0:
                return flow
            self.progress = [0] * self.n
            current_flow = self.dfs(s, t, INF)
            while current_flow > 0:
                flow += current_flow
                current_flow = self.dfs(s, t, INF)

INF = 10**10

def solve(Points):
    h_list = sorted(list(set(h for (h, w) in Points)))
    w_list = sorted(list(set(w for (h, w) in Points)))

    h_dic = {a: i for i, a in enumerate(h_list)}
    w_dic = {a: i for i, a in enumerate(w_list)}

    h_count = len(h_list)
    w_count = len(w_list)
    mf = Dinic(h_count+w_count+2)
    for i in range(h_count):
        mf.add_link(0, i+1, 1)
    for j in range(w_count):
        mf.add_link(j+h_count+1, h_count+w_count+1, 1)
    for h, w in Points:
        h1 = h_dic[h]
        w1 = w_dic[w]
        mf.add_link(h1+1, w1+h_count+1, INF)

    return mf.max_flow(0, h_count+w_count+1)


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

Table = collections.defaultdict(list)
for h in range(H):
    for w in range(W):
        a = A[h][w]
        if a == 0:
            continue
        Table[a].append((h, w))

n = 0
for Points in Table.values():
    n1 = solve(Points)
    n += n1
print(n)
0