結果
問題 | No.1479 Matrix Eraser |
ユーザー | ああいい |
提出日時 | 2022-03-16 00:13:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,155 ms / 3,000 ms |
コード長 | 3,482 bytes |
コンパイル時間 | 673 ms |
コンパイル使用メモリ | 81,676 KB |
実行使用メモリ | 172,340 KB |
最終ジャッジ日時 | 2023-10-23 23:38:11 |
合計ジャッジ時間 | 19,624 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
75,136 KB |
testcase_01 | AC | 54 ms
75,136 KB |
testcase_02 | AC | 55 ms
75,312 KB |
testcase_03 | AC | 55 ms
75,312 KB |
testcase_04 | AC | 55 ms
75,344 KB |
testcase_05 | AC | 56 ms
75,292 KB |
testcase_06 | AC | 56 ms
75,324 KB |
testcase_07 | AC | 290 ms
101,004 KB |
testcase_08 | AC | 260 ms
106,632 KB |
testcase_09 | AC | 338 ms
120,796 KB |
testcase_10 | AC | 513 ms
135,392 KB |
testcase_11 | AC | 372 ms
124,124 KB |
testcase_12 | AC | 246 ms
102,260 KB |
testcase_13 | AC | 255 ms
106,632 KB |
testcase_14 | AC | 236 ms
102,524 KB |
testcase_15 | AC | 95 ms
95,680 KB |
testcase_16 | AC | 240 ms
104,088 KB |
testcase_17 | AC | 597 ms
139,896 KB |
testcase_18 | AC | 571 ms
139,896 KB |
testcase_19 | AC | 593 ms
139,896 KB |
testcase_20 | AC | 610 ms
139,896 KB |
testcase_21 | AC | 625 ms
139,896 KB |
testcase_22 | AC | 593 ms
139,896 KB |
testcase_23 | AC | 613 ms
139,896 KB |
testcase_24 | AC | 562 ms
139,896 KB |
testcase_25 | AC | 551 ms
139,896 KB |
testcase_26 | AC | 550 ms
139,896 KB |
testcase_27 | AC | 1,042 ms
157,288 KB |
testcase_28 | AC | 1,045 ms
156,172 KB |
testcase_29 | AC | 1,004 ms
154,908 KB |
testcase_30 | AC | 960 ms
156,720 KB |
testcase_31 | AC | 1,155 ms
158,956 KB |
testcase_32 | AC | 504 ms
172,264 KB |
testcase_33 | AC | 470 ms
172,092 KB |
testcase_34 | AC | 452 ms
171,964 KB |
testcase_35 | AC | 490 ms
172,340 KB |
testcase_36 | AC | 513 ms
171,384 KB |
testcase_37 | AC | 136 ms
111,080 KB |
testcase_38 | AC | 502 ms
132,776 KB |
testcase_39 | AC | 229 ms
146,164 KB |
testcase_40 | AC | 54 ms
75,180 KB |
ソースコード
#Dinic法で最大流を求める #deque のimport が必要 #逆辺追加しなきゃいけないから、 #グラフの構成はadd_edgeで行う #最大流は flow メソッドで from collections import deque class Dinic: def __init__(self,N): self.N = N self.G = [[] for _ in range(N)] self.level = None self.progress = None self.edge = [] 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) self.edge.append(forward) def add_multi_edge(self,v1,v2,cap1,cap2): edge1 = [v2,cap1,None] edge1[2] = edge2 = [v1,cap2,edge1] self.G[v1].append(edge1) self.G[v2].append(edge2) self.edge.append(edge1) def get_edge(self,i): return self.edge[i] # i 回目に追加した辺のポインタを返す # 0-index, 順辺のみ def bfs(self,s,t): self.level = level = [None] * self.N q = deque([s]) level[s] = 0 G = self.G while q: v = q.popleft() lv = level[v] + 1 for w,cap,_ in G[v]: if cap and level[w] is None: level[w] = lv q.append(w) return level[t] is not None def dfs(self,v,t,f): if v == t:return f level = self.level Gv = self.G[v] for i in range(self.progress[v],len(Gv)): self.progress[v] = i w,cap,rev = e = Gv[i] if cap and level[v] < level[w]: d = self.dfs(w,t,min(f,cap)) if d: e[1] -= d rev[1] += d return d return 0 def flow(self,s,t,): flow = 0 inf = 1 << 30 G = self.G while self.bfs(s,t): self.progress = [0] * self.N f = inf while f: f = self.dfs(s,t,inf) flow += f return flow def min_cut(self,s): #最小カットを実現する頂点の分割を与える #True なら source側 #False なら sink側 visited = [False for i in range(self.N)] q = deque([s]) while q: now = q.popleft() visited[now] = True for to,cap,_ in self.G[now]: if cap and not visited[to]: visited[to] = True q.append(to) return visited H,W = map(int,input().split()) A = [list(map(int,input().split())) for _ in range(H)] d = [[] for _ in range(5 * 10 ** 5 + 1)] s = set() for h in range(H): for w in range(W): d[A[h][w]].append((h,w)) s.add(A[h][w]) inf = 1 << 30 ans = 0 for k in s: if k == 0:continue l = d[k] if len(l) == 1: ans += 1 continue ch = set() cw = set() for h,w in l: ch.add(h) cw.add(w) rDh = sorted(ch) rDw = sorted(cw) Dh = {v:i for i,v in enumerate(rDh)} Dw = {v:i for i,v in enumerate(rDw)} n = len(Dh) + len(Dw) dinic = Dinic(n + 2) T = n + 1 base = len(Dh) for h,w in l: dinic.add_edge(Dh[h]+1,base + Dw[w] + 1,inf) for i in range(base): dinic.add_edge(0,i+1,1) for i in range(len(Dw)): dinic.add_edge(base + i + 1,T,1) ans += dinic.flow(0,T) print(ans)