結果
問題 | No.1479 Matrix Eraser |
ユーザー | 小野寺健 |
提出日時 | 2021-04-29 08:54:52 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 2,369 ms / 3,000 ms |
コード長 | 2,074 bytes |
コンパイル時間 | 539 ms |
コンパイル使用メモリ | 10,980 KB |
実行使用メモリ | 187,260 KB |
最終ジャッジ日時 | 2023-09-22 16:34:19 |
合計ジャッジ時間 | 53,265 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
8,012 KB |
testcase_01 | AC | 16 ms
8,036 KB |
testcase_02 | AC | 16 ms
8,096 KB |
testcase_03 | AC | 17 ms
8,008 KB |
testcase_04 | AC | 17 ms
8,056 KB |
testcase_05 | AC | 17 ms
8,188 KB |
testcase_06 | AC | 17 ms
8,028 KB |
testcase_07 | AC | 230 ms
28,516 KB |
testcase_08 | AC | 391 ms
42,824 KB |
testcase_09 | AC | 845 ms
78,864 KB |
testcase_10 | AC | 1,688 ms
129,824 KB |
testcase_11 | AC | 1,005 ms
90,408 KB |
testcase_12 | AC | 284 ms
33,996 KB |
testcase_13 | AC | 395 ms
42,916 KB |
testcase_14 | AC | 296 ms
35,080 KB |
testcase_15 | AC | 78 ms
14,220 KB |
testcase_16 | AC | 331 ms
37,688 KB |
testcase_17 | AC | 2,075 ms
155,332 KB |
testcase_18 | AC | 2,063 ms
155,604 KB |
testcase_19 | AC | 2,074 ms
155,584 KB |
testcase_20 | AC | 2,046 ms
155,608 KB |
testcase_21 | AC | 2,039 ms
155,516 KB |
testcase_22 | AC | 2,086 ms
155,324 KB |
testcase_23 | AC | 2,073 ms
155,240 KB |
testcase_24 | AC | 2,073 ms
155,396 KB |
testcase_25 | AC | 2,072 ms
155,512 KB |
testcase_26 | AC | 2,079 ms
155,520 KB |
testcase_27 | AC | 1,929 ms
34,536 KB |
testcase_28 | AC | 1,904 ms
34,628 KB |
testcase_29 | AC | 1,907 ms
34,460 KB |
testcase_30 | AC | 1,926 ms
34,528 KB |
testcase_31 | AC | 1,899 ms
34,492 KB |
testcase_32 | AC | 1,986 ms
38,632 KB |
testcase_33 | AC | 1,947 ms
38,592 KB |
testcase_34 | AC | 1,966 ms
38,656 KB |
testcase_35 | AC | 1,940 ms
38,516 KB |
testcase_36 | AC | 1,959 ms
38,712 KB |
testcase_37 | AC | 81 ms
8,388 KB |
testcase_38 | AC | 2,369 ms
56,628 KB |
testcase_39 | AC | 2,171 ms
187,260 KB |
testcase_40 | AC | 17 ms
8,092 KB |
ソースコード
def add_edge(u, v): global match G[u].append(v) G[v].append(u) def dfs(v): global match, G, used used[v] = True for i in range(len(G[v])): u = G[v][i] w = match[u] if w < 0 or not used[w] and dfs(w): match[v] = u match[u] = v return True return False def bipartite_matching(): global match, V, used res = 0 match = [-1] * V for v in range(V): if match[v] < 0: used = [False] * V if dfs(v): res += 1 return res def matches(h, w, edges): global G, V, match V = h + w G = [[] for _ in range(V)] for v in range(h): for u in edges[v]: add_edge(v, u+h) res = bipartite_matching() return match[h:h+w] def mpc(xn, yn): global edges matched = matches(xn, yn, edges) left = xn right = 0 redges = matched for v in range(xn): if v not in matched: left -= 1 for u in edges[v]: right += 1 if redges[u] >= 0: left -= 1 return left + right if __name__ == '__main__': H, W = map(int, input().split()) S = dict() for i in range(H): for j, a in enumerate(list(map(int, input().split()))): if a > 0: if a not in S: S[a] = [dict(), dict()] if i in S[a][0]: ai = S[a][0][i] else: ai = len(S[a][0]) S[a][0][i] = ai if j in S[a][1]: aj = S[a][1][j] else: aj = len(S[a][1]) S[a][1][j] = aj S[a].append((ai, aj)) cnt = 0 for a, pairs in S.items(): h = len(pairs[0]) w = len(pairs[1]) edges = [set() for _ in range(h)] for i, j in pairs[2:]: edges[i].add(j) n = mpc(h, w) cnt += n print(cnt)