結果
問題 | No.1479 Matrix Eraser |
ユーザー | eijirou |
提出日時 | 2021-04-17 15:18:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 785 ms / 3,000 ms |
コード長 | 3,413 bytes |
コンパイル時間 | 585 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 147,948 KB |
最終ジャッジ日時 | 2023-09-17 00:29:48 |
合計ジャッジ時間 | 22,030 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 85 ms
71,828 KB |
testcase_01 | AC | 84 ms
71,748 KB |
testcase_02 | AC | 89 ms
72,092 KB |
testcase_03 | AC | 88 ms
72,264 KB |
testcase_04 | AC | 90 ms
72,220 KB |
testcase_05 | AC | 90 ms
71,824 KB |
testcase_06 | AC | 92 ms
72,524 KB |
testcase_07 | AC | 298 ms
85,496 KB |
testcase_08 | AC | 341 ms
91,200 KB |
testcase_09 | AC | 463 ms
103,444 KB |
testcase_10 | AC | 636 ms
118,260 KB |
testcase_11 | AC | 498 ms
106,684 KB |
testcase_12 | AC | 293 ms
87,676 KB |
testcase_13 | AC | 343 ms
91,164 KB |
testcase_14 | AC | 303 ms
87,700 KB |
testcase_15 | AC | 179 ms
81,388 KB |
testcase_16 | AC | 308 ms
88,984 KB |
testcase_17 | AC | 722 ms
126,324 KB |
testcase_18 | AC | 727 ms
126,560 KB |
testcase_19 | AC | 754 ms
126,256 KB |
testcase_20 | AC | 730 ms
126,564 KB |
testcase_21 | AC | 758 ms
126,280 KB |
testcase_22 | AC | 779 ms
126,360 KB |
testcase_23 | AC | 740 ms
126,316 KB |
testcase_24 | AC | 744 ms
126,376 KB |
testcase_25 | AC | 758 ms
126,532 KB |
testcase_26 | AC | 777 ms
126,212 KB |
testcase_27 | AC | 746 ms
115,668 KB |
testcase_28 | AC | 707 ms
115,356 KB |
testcase_29 | AC | 746 ms
114,952 KB |
testcase_30 | AC | 735 ms
113,840 KB |
testcase_31 | AC | 785 ms
116,348 KB |
testcase_32 | AC | 480 ms
147,280 KB |
testcase_33 | AC | 444 ms
147,600 KB |
testcase_34 | AC | 444 ms
146,948 KB |
testcase_35 | AC | 462 ms
147,384 KB |
testcase_36 | AC | 452 ms
147,948 KB |
testcase_37 | AC | 129 ms
96,264 KB |
testcase_38 | AC | 438 ms
104,068 KB |
testcase_39 | AC | 691 ms
130,596 KB |
testcase_40 | AC | 85 ms
71,588 KB |
ソースコード
# Reference: https://tjkendev.github.io/procon-library/python/max_flow/dinic.html # Max Flow # 0-indexed from collections import deque from sys import setrecursionlimit setrecursionlimit(10**9) class Dinic: def __init__(self, n): self.n = n self.G = [[] for _ in range(n)] def add_edge(self, fr, to, cap): forward = [to, cap, None] forward[2] = backward = [fr, 0, forward] self.G[fr].append(forward) self.G[to].append(backward) def bfs(self, s, t): self.level = level = [None] * self.n deq = deque([s]) level[s] = 0 G = self.G while deq: v = deq.popleft() lv = level[v] + 1 for w, cap, _ in G[v]: if cap and level[w] is None: level[w] = lv deq.append(w) return level[t] is not None def dfs(self, v, t, f): if v == t: return f level = self.level for edge in self.it[v]: w, cap, rev = edge if cap and level[v] < level[w]: d = self.dfs(w, t, min(f, cap)) if d: edge[1] -= d rev[1] += d return d return 0 def flow(self, s, t, inf=1<<30): flow = 0 G = self.G while self.bfs(s, t): *self.it, = map(iter, self.G) f = inf while f: f = self.dfs(s, t, inf) flow += f return flow ### # Reference: https://www.slideshare.net/drken1215/ss-86894312 ### from collections import defaultdict from sys import stdin input = stdin.readline def main(): h, w = map(int, input().split()) a = [list(map(int, input().split())) for _ in range(h)] groups = defaultdict(list) for i in range(h): for j in range(w): groups[a[i][j]].append(w*i + j) if 0 in groups: groups.pop(0) ans = 0 for lis in groups.values(): rows = dict() columns = dict() for i in lis: if i//w not in rows: rows[i//w] = len(rows) if i%w not in columns: columns[i%w] = len(columns) # Max Flow # s >>> rows >>> columns >>> t s = len(rows)+len(columns) t = s + 1 mf = Dinic(t+1) for value in rows.values(): mf.add_edge(s, value, 1) for value in columns.values(): mf.add_edge(value+len(rows), t, 1) for i in lis: mf.add_edge(rows[i//w], columns[i%w]+len(rows), 1) mf.flow(s, t, len(lis)) edges = [[] for _ in range(s)] todo = [] for i in range(len(rows)): for j, cap, rev in mf.G[i]: if j == s or j == t: continue if rev[1]: edges[i].append(j) else: edges[j].append(i) todo.append(i) seen = [0] * s for start in todo: seen[start] = 1 while todo: i = todo.pop() for j in edges[i]: if seen[j]: continue seen[j] = 1 todo.append(j) ans += seen[:len(rows)].count(0) + seen[len(rows):].count(1) print(ans) main()