結果
問題 | No.1479 Matrix Eraser |
ユーザー | ああいい |
提出日時 | 2022-03-16 00:02:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,422 ms / 3,000 ms |
コード長 | 3,417 bytes |
コンパイル時間 | 1,798 ms |
コンパイル使用メモリ | 81,728 KB |
実行使用メモリ | 302,052 KB |
最終ジャッジ日時 | 2023-10-23 23:24:46 |
合計ジャッジ時間 | 32,595 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,536 KB |
testcase_01 | AC | 45 ms
55,536 KB |
testcase_02 | AC | 42 ms
55,536 KB |
testcase_03 | AC | 43 ms
55,536 KB |
testcase_04 | AC | 44 ms
55,536 KB |
testcase_05 | AC | 42 ms
55,536 KB |
testcase_06 | AC | 43 ms
55,536 KB |
testcase_07 | AC | 356 ms
106,188 KB |
testcase_08 | AC | 441 ms
123,040 KB |
testcase_09 | AC | 730 ms
161,476 KB |
testcase_10 | AC | 1,210 ms
227,552 KB |
testcase_11 | AC | 825 ms
175,876 KB |
testcase_12 | AC | 376 ms
114,000 KB |
testcase_13 | AC | 446 ms
123,108 KB |
testcase_14 | AC | 392 ms
112,064 KB |
testcase_15 | AC | 195 ms
85,608 KB |
testcase_16 | AC | 380 ms
112,200 KB |
testcase_17 | AC | 1,319 ms
259,908 KB |
testcase_18 | AC | 1,422 ms
259,020 KB |
testcase_19 | AC | 1,289 ms
258,616 KB |
testcase_20 | AC | 1,291 ms
259,368 KB |
testcase_21 | AC | 1,282 ms
258,536 KB |
testcase_22 | AC | 1,345 ms
258,748 KB |
testcase_23 | AC | 1,316 ms
258,464 KB |
testcase_24 | AC | 1,359 ms
258,160 KB |
testcase_25 | AC | 1,393 ms
258,496 KB |
testcase_26 | AC | 1,298 ms
258,984 KB |
testcase_27 | AC | 1,063 ms
139,692 KB |
testcase_28 | AC | 1,052 ms
137,492 KB |
testcase_29 | AC | 994 ms
138,276 KB |
testcase_30 | AC | 1,002 ms
137,348 KB |
testcase_31 | AC | 1,105 ms
142,068 KB |
testcase_32 | AC | 462 ms
150,472 KB |
testcase_33 | AC | 440 ms
150,368 KB |
testcase_34 | AC | 427 ms
150,548 KB |
testcase_35 | AC | 456 ms
150,464 KB |
testcase_36 | AC | 475 ms
151,992 KB |
testcase_37 | AC | 75 ms
77,540 KB |
testcase_38 | AC | 524 ms
140,608 KB |
testcase_39 | AC | 1,280 ms
302,052 KB |
testcase_40 | AC | 44 ms
55,540 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)] from collections import defaultdict d = defaultdict(list) ch = defaultdict(set) cw = defaultdict(set) for h in range(H): for w in range(W): if A[h][w]: d[A[h][w]].append((h,w)) ch[A[h][w]].add(h) cw[A[h][w]].add(w) inf = 1 << 30 ans = 0 for k in d: rDh = sorted(ch[k]) rDw = sorted(cw[k]) 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 d[k]: 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)