結果

問題 No.1479 Matrix Eraser
ユーザー shotoyooshotoyoo
提出日時 2021-05-25 01:53:51
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 776 ms / 3,000 ms
コード長 6,096 bytes
コンパイル時間 197 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 144,384 KB
最終ジャッジ日時 2024-04-21 11:27:56
合計ジャッジ時間 18,915 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
68,480 KB
testcase_01 AC 69 ms
68,864 KB
testcase_02 AC 84 ms
69,120 KB
testcase_03 AC 76 ms
69,248 KB
testcase_04 AC 81 ms
69,376 KB
testcase_05 AC 69 ms
68,992 KB
testcase_06 AC 70 ms
69,120 KB
testcase_07 AC 302 ms
85,760 KB
testcase_08 AC 388 ms
92,160 KB
testcase_09 AC 449 ms
99,328 KB
testcase_10 AC 644 ms
112,640 KB
testcase_11 AC 474 ms
101,888 KB
testcase_12 AC 331 ms
87,808 KB
testcase_13 AC 346 ms
92,160 KB
testcase_14 AC 322 ms
88,064 KB
testcase_15 AC 210 ms
81,024 KB
testcase_16 AC 452 ms
89,472 KB
testcase_17 AC 740 ms
120,320 KB
testcase_18 AC 752 ms
120,576 KB
testcase_19 AC 731 ms
120,448 KB
testcase_20 AC 741 ms
120,576 KB
testcase_21 AC 750 ms
120,704 KB
testcase_22 AC 776 ms
120,832 KB
testcase_23 AC 708 ms
120,576 KB
testcase_24 AC 760 ms
120,576 KB
testcase_25 AC 699 ms
120,832 KB
testcase_26 AC 749 ms
120,704 KB
testcase_27 AC 448 ms
103,680 KB
testcase_28 AC 466 ms
104,064 KB
testcase_29 AC 452 ms
103,808 KB
testcase_30 AC 466 ms
103,808 KB
testcase_31 AC 464 ms
103,424 KB
testcase_32 AC 361 ms
142,336 KB
testcase_33 AC 340 ms
142,720 KB
testcase_34 AC 344 ms
142,720 KB
testcase_35 AC 334 ms
142,592 KB
testcase_36 AC 360 ms
144,384 KB
testcase_37 AC 95 ms
78,208 KB
testcase_38 AC 434 ms
107,136 KB
testcase_39 AC 660 ms
126,948 KB
testcase_40 AC 68 ms
68,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda : sys.stdin.readline().rstrip()

sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))

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, capacity: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        m = len(self._edges)
        e = MFGraph._Edge(dst, capacity)
        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
### 二部グラフマッチングの例
def bimatch(ns):
    n = len(ns)
    m = n
    # DiGraphにしないとMinフローと最大マッチングが一致しない
    g = MFGraph(n+m+2)
    s = n+m
    t = n+m+1
    for u in range(n):
        g.add_edge(s, u, capacity=1)
        for v in ns[u]:
            g.add_edge(u, v+n, capacity=1)
    for v in range(m):
            g.add_edge(n+v, t, capacity=1)
    val = g.flow(s, t, flow_limit=n)
    return val, g.edges()
"""g.edges()でe.src, e.dst, e.flow各枝の情報がわかる
"""
def sub(es):
    sl = {}
    sr = {}
    i = j = 0
    for l,r in es:
        if l not in sl:
            sl[l] = i
            i += 1
        if r not in sr:
            sr[r] = j
            j += 1
    n = len(sl)
    m = len(sr)
    g = MFGraph(n+m+2)
    s = n+m
    t = n+m+1
    for u in range(n):
        g.add_edge(s, u, capacity=1)
    for v in range(m):
        g.add_edge(n+v, t, capacity=1)
    for l,r in es:
        i = sl[l]
        j = sr[r]
        g.add_edge(i, n+j, capacity=1)
    val = g.flow(s, t, flow_limit=n)
    return val
h,w = list(map(int, input().split()))
d = {}
for i in range(h):
    l = list(map(int, input().split()))
    for j in range(w):
        v = l[j]
        if v==0:
            continue
        d.setdefault(v, [])
        d[v].append((i,j+h))
ans = 0
for k,es in d.items():
    v = sub(es)
    ans += v
#     print(es,v)
print(ans)
0