結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー | opt |
提出日時 | 2020-12-12 22:25:44 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 262 ms / 2,000 ms |
コード長 | 3,129 bytes |
コンパイル時間 | 327 ms |
コンパイル使用メモリ | 12,144 KB |
実行使用メモリ | 11,248 KB |
最終ジャッジ日時 | 2023-10-20 02:43:51 |
合計ジャッジ時間 | 11,922 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
10,480 KB |
testcase_01 | AC | 30 ms
10,480 KB |
testcase_02 | AC | 29 ms
10,480 KB |
testcase_03 | AC | 31 ms
10,556 KB |
testcase_04 | AC | 30 ms
10,480 KB |
testcase_05 | AC | 29 ms
10,480 KB |
testcase_06 | AC | 30 ms
10,484 KB |
testcase_07 | AC | 172 ms
11,096 KB |
testcase_08 | AC | 193 ms
11,132 KB |
testcase_09 | AC | 196 ms
10,932 KB |
testcase_10 | AC | 202 ms
10,912 KB |
testcase_11 | AC | 58 ms
10,876 KB |
testcase_12 | AC | 55 ms
10,848 KB |
testcase_13 | AC | 51 ms
10,812 KB |
testcase_14 | AC | 53 ms
10,816 KB |
testcase_15 | AC | 182 ms
11,168 KB |
testcase_16 | AC | 242 ms
11,248 KB |
testcase_17 | AC | 184 ms
11,096 KB |
testcase_18 | AC | 215 ms
11,228 KB |
testcase_19 | AC | 43 ms
10,748 KB |
testcase_20 | AC | 44 ms
10,748 KB |
testcase_21 | AC | 42 ms
10,712 KB |
testcase_22 | AC | 42 ms
10,712 KB |
testcase_23 | AC | 44 ms
10,760 KB |
testcase_24 | AC | 45 ms
10,740 KB |
testcase_25 | AC | 45 ms
10,716 KB |
testcase_26 | AC | 44 ms
10,720 KB |
testcase_27 | AC | 38 ms
10,768 KB |
testcase_28 | AC | 38 ms
10,768 KB |
testcase_29 | AC | 38 ms
10,744 KB |
testcase_30 | AC | 38 ms
10,744 KB |
testcase_31 | AC | 41 ms
10,768 KB |
testcase_32 | AC | 45 ms
10,772 KB |
testcase_33 | AC | 41 ms
10,752 KB |
testcase_34 | AC | 42 ms
10,732 KB |
testcase_35 | AC | 37 ms
10,768 KB |
testcase_36 | AC | 38 ms
10,768 KB |
testcase_37 | AC | 37 ms
10,744 KB |
testcase_38 | AC | 39 ms
10,744 KB |
testcase_39 | AC | 41 ms
10,772 KB |
testcase_40 | AC | 42 ms
10,768 KB |
testcase_41 | AC | 41 ms
10,744 KB |
testcase_42 | AC | 41 ms
10,752 KB |
testcase_43 | AC | 126 ms
11,008 KB |
testcase_44 | AC | 135 ms
10,860 KB |
testcase_45 | AC | 179 ms
10,852 KB |
testcase_46 | AC | 196 ms
10,868 KB |
testcase_47 | AC | 85 ms
10,848 KB |
testcase_48 | AC | 86 ms
10,828 KB |
testcase_49 | AC | 81 ms
10,808 KB |
testcase_50 | AC | 80 ms
10,808 KB |
testcase_51 | AC | 146 ms
10,996 KB |
testcase_52 | AC | 139 ms
11,004 KB |
testcase_53 | AC | 205 ms
10,872 KB |
testcase_54 | AC | 197 ms
10,936 KB |
testcase_55 | AC | 184 ms
10,936 KB |
testcase_56 | AC | 197 ms
10,892 KB |
testcase_57 | AC | 182 ms
11,044 KB |
testcase_58 | AC | 232 ms
10,992 KB |
testcase_59 | AC | 186 ms
10,948 KB |
testcase_60 | AC | 170 ms
10,896 KB |
testcase_61 | AC | 240 ms
11,112 KB |
testcase_62 | AC | 223 ms
11,032 KB |
testcase_63 | AC | 224 ms
11,096 KB |
testcase_64 | AC | 173 ms
10,904 KB |
testcase_65 | AC | 210 ms
11,164 KB |
testcase_66 | AC | 249 ms
11,184 KB |
testcase_67 | AC | 237 ms
11,164 KB |
testcase_68 | AC | 203 ms
11,160 KB |
testcase_69 | AC | 207 ms
11,132 KB |
testcase_70 | AC | 215 ms
11,136 KB |
testcase_71 | AC | 244 ms
11,104 KB |
testcase_72 | AC | 262 ms
11,092 KB |
testcase_73 | AC | 213 ms
11,164 KB |
testcase_74 | AC | 244 ms
11,152 KB |
testcase_75 | AC | 49 ms
10,784 KB |
testcase_76 | AC | 52 ms
10,780 KB |
testcase_77 | AC | 50 ms
10,780 KB |
testcase_78 | AC | 188 ms
11,008 KB |
testcase_79 | AC | 188 ms
11,152 KB |
testcase_80 | AC | 208 ms
11,100 KB |
testcase_81 | AC | 107 ms
10,920 KB |
ソースコード
# Dinic's algorithm from: # https://tjkendev.github.io/procon-library/python/max_flow/dinic.html from collections import deque class Dinic: def __init__(self, N): self.N = N self.G = [[] for i 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 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, 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 e in self.it[v]: w, cap, rev = e 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 = 10**9 + 7 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 ########################################## n, m, k = map(int, input().split()) edges = [list(map(int, input().split())) for _ in range(m)] edges.sort(key=lambda x: x[2]) y = [0] * m s, t = 0, n+1 ysum = ans = 0 # 多重辺を気にせず張る # for i, (a, b, c, d) in enumerate(edges): # g = Dinic(n+2) # for j, (a2, b2, _, _) in enumerate(edges): # if y[j] > 0: # 定数倍改善のため,容量 0 の辺を追加しない.追加しても問題無い # g.add_edge(s, a2, y[j]) # g.add_edge(a2, b2, y[j]) # for v in range(1, n+1): # g.add_edge(v, t, k) # g.add_edge(s, a, k*n) # g.add_edge(s, b, k*n) # f = g.flow(s, t) # z = f - k - ysum # y[i] = min(z, d) # ysum += y[i] # ans += c * y[i] # 多重辺を張らないようにして定数倍高速化 cs = [0] * (n+1) for i, (a, b, c, d) in enumerate(edges): g = Dinic(n+2) for j, (a2, b2, _, _) in enumerate(edges): if y[j] > 0: # 定数倍改善のため,容量 0 の辺を追加しない.追加しても問題無い g.add_edge(a2, b2, y[j]) for v in range(1, n+1): g.add_edge(v, t, k) if v == a or v == b: g.add_edge(s, v, k*n) elif cs[v] > 0: g.add_edge(s, v, cs[v]) f = g.flow(s, t) z = f - k - ysum y[i] = min(z, d) ysum += y[i] ans += c * y[i] cs[a] += y[i] if ysum < k*(n-1): ans = -1 print(ans)