結果
問題 | No.1479 Matrix Eraser |
ユーザー | rlangevin |
提出日時 | 2024-05-21 12:12:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 969 ms / 3,000 ms |
コード長 | 5,932 bytes |
コンパイル時間 | 257 ms |
コンパイル使用メモリ | 82,472 KB |
実行使用メモリ | 193,024 KB |
最終ジャッジ日時 | 2024-05-21 12:12:35 |
合計ジャッジ時間 | 26,155 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
92,364 KB |
testcase_01 | AC | 103 ms
92,192 KB |
testcase_02 | AC | 103 ms
92,612 KB |
testcase_03 | AC | 104 ms
92,584 KB |
testcase_04 | AC | 106 ms
92,540 KB |
testcase_05 | AC | 115 ms
92,480 KB |
testcase_06 | AC | 104 ms
92,188 KB |
testcase_07 | AC | 313 ms
120,240 KB |
testcase_08 | AC | 412 ms
123,920 KB |
testcase_09 | AC | 605 ms
131,900 KB |
testcase_10 | AC | 734 ms
142,864 KB |
testcase_11 | AC | 631 ms
134,064 KB |
testcase_12 | AC | 397 ms
122,892 KB |
testcase_13 | AC | 433 ms
124,928 KB |
testcase_14 | AC | 385 ms
122,648 KB |
testcase_15 | AC | 159 ms
115,212 KB |
testcase_16 | AC | 388 ms
123,608 KB |
testcase_17 | AC | 898 ms
147,732 KB |
testcase_18 | AC | 946 ms
147,692 KB |
testcase_19 | AC | 969 ms
148,100 KB |
testcase_20 | AC | 953 ms
147,712 KB |
testcase_21 | AC | 918 ms
147,116 KB |
testcase_22 | AC | 900 ms
147,680 KB |
testcase_23 | AC | 894 ms
147,484 KB |
testcase_24 | AC | 923 ms
147,540 KB |
testcase_25 | AC | 938 ms
147,880 KB |
testcase_26 | AC | 924 ms
147,416 KB |
testcase_27 | AC | 741 ms
160,760 KB |
testcase_28 | AC | 780 ms
159,872 KB |
testcase_29 | AC | 768 ms
159,276 KB |
testcase_30 | AC | 716 ms
158,228 KB |
testcase_31 | AC | 753 ms
159,432 KB |
testcase_32 | AC | 597 ms
192,244 KB |
testcase_33 | AC | 603 ms
193,024 KB |
testcase_34 | AC | 565 ms
192,784 KB |
testcase_35 | AC | 614 ms
192,916 KB |
testcase_36 | AC | 585 ms
192,364 KB |
testcase_37 | AC | 199 ms
132,884 KB |
testcase_38 | AC | 748 ms
151,656 KB |
testcase_39 | AC | 272 ms
144,956 KB |
testcase_40 | AC | 97 ms
92,584 KB |
ソースコード
import sys input = sys.stdin.readline #https://github.com/not522/ac-library-python/blob/master/atcoder/maxflow.py 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 from bisect import * from copy import deepcopy def compress(lst): ''' B: lstを座圧したリスト idx_to_val: indexから元の値を取得するリスト val_to_idx: 元の値からindexを取得する辞書 ''' B = [] val_to_idx = {} idx_to_val = deepcopy(lst) idx_to_val = list(set(idx_to_val)) idx_to_val.sort() for i in range(len(lst)): ind = bisect_left(idx_to_val, lst[i]) B.append(ind) for i in range(len(B)): val_to_idx[lst[i]] = B[i] return B, idx_to_val, val_to_idx H, W = map(int, input().split()) M = 5 * 10 ** 5 + 5 Dx, Dy = [[] for i in range(M)], [[] for i in range(M)] for i in range(H): A = list(map(int, input().split())) for j in range(W): Dx[A[j]].append(i) Dy[A[j]].append(j) def solve(X, Y): if len(X) <= 1: return len(X) X, ivx, _ = compress(X) Y, ivy, _ = compress(Y) tate = len(ivx) yoko = len(ivy) s = tate + yoko g = s + 1 G = MFGraph(tate + yoko + 2) for i in range(tate): G.add_edge(s, i, 1) for i in range(yoko): G.add_edge(tate + i, g, 1) for x, y in zip(X, Y): G.add_edge(x, tate + y, 1) return G.flow(s, g) ans = 0 for i in range(M-1, 0, -1): ans += solve(Dx[i], Dy[i]) print(ans)