結果
問題 | No.1479 Matrix Eraser |
ユーザー | ayaoni |
提出日時 | 2021-04-17 03:18:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 883 ms / 3,000 ms |
コード長 | 2,809 bytes |
コンパイル時間 | 354 ms |
コンパイル使用メモリ | 86,912 KB |
実行使用メモリ | 158,008 KB |
最終ジャッジ日時 | 2023-09-16 07:40:20 |
合計ジャッジ時間 | 23,945 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
80,812 KB |
testcase_01 | AC | 103 ms
80,796 KB |
testcase_02 | AC | 102 ms
80,712 KB |
testcase_03 | AC | 103 ms
80,784 KB |
testcase_04 | AC | 103 ms
80,828 KB |
testcase_05 | AC | 103 ms
80,976 KB |
testcase_06 | AC | 102 ms
80,676 KB |
testcase_07 | AC | 344 ms
103,992 KB |
testcase_08 | AC | 356 ms
104,780 KB |
testcase_09 | AC | 457 ms
110,056 KB |
testcase_10 | AC | 722 ms
118,948 KB |
testcase_11 | AC | 531 ms
112,516 KB |
testcase_12 | AC | 342 ms
103,780 KB |
testcase_13 | AC | 381 ms
104,916 KB |
testcase_14 | AC | 339 ms
103,792 KB |
testcase_15 | AC | 198 ms
100,040 KB |
testcase_16 | AC | 339 ms
104,116 KB |
testcase_17 | AC | 813 ms
123,080 KB |
testcase_18 | AC | 793 ms
122,896 KB |
testcase_19 | AC | 794 ms
122,192 KB |
testcase_20 | AC | 818 ms
122,660 KB |
testcase_21 | AC | 797 ms
122,652 KB |
testcase_22 | AC | 807 ms
123,056 KB |
testcase_23 | AC | 810 ms
122,156 KB |
testcase_24 | AC | 798 ms
122,220 KB |
testcase_25 | AC | 791 ms
123,124 KB |
testcase_26 | AC | 807 ms
122,364 KB |
testcase_27 | AC | 839 ms
137,704 KB |
testcase_28 | AC | 800 ms
136,096 KB |
testcase_29 | AC | 857 ms
137,788 KB |
testcase_30 | AC | 852 ms
138,692 KB |
testcase_31 | AC | 883 ms
138,780 KB |
testcase_32 | AC | 465 ms
157,668 KB |
testcase_33 | AC | 432 ms
157,920 KB |
testcase_34 | AC | 391 ms
157,656 KB |
testcase_35 | AC | 463 ms
158,008 KB |
testcase_36 | AC | 458 ms
157,580 KB |
testcase_37 | AC | 147 ms
105,784 KB |
testcase_38 | AC | 467 ms
127,144 KB |
testcase_39 | AC | 749 ms
125,028 KB |
testcase_40 | AC | 102 ms
80,776 KB |
ソースコード
import sys from collections import deque sys.setrecursionlimit(10**7) def I(): return int(sys.stdin.readline().rstrip()) def MI(): return map(int,sys.stdin.readline().rstrip().split()) def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) def LI2(): return list(map(int,sys.stdin.readline().rstrip())) def S(): return sys.stdin.readline().rstrip() def LS(): return list(sys.stdin.readline().rstrip().split()) def LS2(): return list(sys.stdin.readline().rstrip()) class Dinic: def __init__(self, N, inf): self.N = N self.inf = inf self.G = [[] for _ in range(N)] self.level = [0]*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 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) def bfs(self, s): self.level = [-1]*self.N deq = deque([s]) self.level[s] = 0 while deq: v = deq.pop() lv = self.level[v] + 1 for w, cap, _ in self.G[v]: if cap > 0 and self.level[w] == -1: self.level[w] = lv deq.appendleft(w) def dfs(self, v, t, f): if v == t: return f for e in self.iter[v]: w, cap, rev = e if cap > 0 and self.level[v] < self.level[w]: d = self.dfs(w, t, min(f, cap)) if d > 0: e[1] -= d rev[1] += d return d return 0 def flow(self, s, t): flow = 0 while True: self.bfs(s) if self.level[t] == -1: return flow *self.iter, = map(iter, self.G) f = self.inf while f > 0: f = self.dfs(s, t, self.inf) flow += f H,W = MI() A = [LI() for _ in range(H)] X = [[] for _ in range(5*10**5+1)] for i in range(H): for j in range(W): a = A[i][j] X[a].append((i,j)) ans = 0 inf = 10**18 for i in range(1,5*10**5+1): if not X[i]: continue A = set() B = set() for h,w in X[i]: A.add(h) B.add(w) A = list(A) B = list(B) lA = len(A) lB = len(B) Di = Dinic(lA+lB+2,inf) S = lA+lB T = lA+lB+1 dic_A = {} dic_B = {} for j in range(lA): dic_A[A[j]] = j Di.add_edge(S,j,1) for j in range(lB): dic_B[B[j]] = j+lA Di.add_edge(j+lA,T,1) for h,w in X[i]: Di.add_edge(dic_A[h],dic_B[w],1) ans += Di.flow(S,T) print(ans)