結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー | opt |
提出日時 | 2020-12-12 22:36:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 425 ms / 2,000 ms |
コード長 | 3,129 bytes |
コンパイル時間 | 154 ms |
コンパイル使用メモリ | 81,708 KB |
実行使用メモリ | 80,484 KB |
最終ジャッジ日時 | 2023-10-20 02:44:36 |
合計ジャッジ時間 | 20,352 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
55,564 KB |
testcase_01 | AC | 42 ms
55,564 KB |
testcase_02 | AC | 40 ms
55,564 KB |
testcase_03 | AC | 65 ms
70,192 KB |
testcase_04 | AC | 41 ms
55,564 KB |
testcase_05 | AC | 41 ms
55,564 KB |
testcase_06 | AC | 42 ms
55,564 KB |
testcase_07 | AC | 354 ms
79,972 KB |
testcase_08 | AC | 373 ms
80,336 KB |
testcase_09 | AC | 320 ms
79,244 KB |
testcase_10 | AC | 317 ms
78,924 KB |
testcase_11 | AC | 183 ms
78,272 KB |
testcase_12 | AC | 153 ms
77,360 KB |
testcase_13 | AC | 170 ms
77,468 KB |
testcase_14 | AC | 174 ms
78,244 KB |
testcase_15 | AC | 360 ms
80,056 KB |
testcase_16 | AC | 355 ms
79,300 KB |
testcase_17 | AC | 346 ms
79,320 KB |
testcase_18 | AC | 369 ms
79,452 KB |
testcase_19 | AC | 113 ms
76,332 KB |
testcase_20 | AC | 121 ms
76,956 KB |
testcase_21 | AC | 112 ms
76,876 KB |
testcase_22 | AC | 117 ms
77,028 KB |
testcase_23 | AC | 129 ms
77,168 KB |
testcase_24 | AC | 139 ms
77,652 KB |
testcase_25 | AC | 131 ms
77,392 KB |
testcase_26 | AC | 131 ms
77,432 KB |
testcase_27 | AC | 99 ms
76,180 KB |
testcase_28 | AC | 99 ms
76,372 KB |
testcase_29 | AC | 99 ms
76,180 KB |
testcase_30 | AC | 100 ms
76,348 KB |
testcase_31 | AC | 115 ms
76,868 KB |
testcase_32 | AC | 130 ms
77,348 KB |
testcase_33 | AC | 123 ms
77,088 KB |
testcase_34 | AC | 124 ms
77,020 KB |
testcase_35 | AC | 103 ms
76,268 KB |
testcase_36 | AC | 96 ms
76,244 KB |
testcase_37 | AC | 104 ms
76,348 KB |
testcase_38 | AC | 99 ms
76,176 KB |
testcase_39 | AC | 122 ms
77,040 KB |
testcase_40 | AC | 115 ms
76,864 KB |
testcase_41 | AC | 119 ms
77,068 KB |
testcase_42 | AC | 120 ms
77,056 KB |
testcase_43 | AC | 249 ms
79,280 KB |
testcase_44 | AC | 248 ms
78,716 KB |
testcase_45 | AC | 263 ms
78,540 KB |
testcase_46 | AC | 303 ms
78,540 KB |
testcase_47 | AC | 207 ms
78,340 KB |
testcase_48 | AC | 209 ms
78,352 KB |
testcase_49 | AC | 202 ms
78,336 KB |
testcase_50 | AC | 208 ms
78,548 KB |
testcase_51 | AC | 306 ms
79,268 KB |
testcase_52 | AC | 263 ms
78,392 KB |
testcase_53 | AC | 354 ms
79,684 KB |
testcase_54 | AC | 372 ms
79,748 KB |
testcase_55 | AC | 304 ms
78,636 KB |
testcase_56 | AC | 260 ms
78,464 KB |
testcase_57 | AC | 264 ms
78,052 KB |
testcase_58 | AC | 293 ms
78,512 KB |
testcase_59 | AC | 296 ms
78,340 KB |
testcase_60 | AC | 342 ms
79,144 KB |
testcase_61 | AC | 305 ms
78,564 KB |
testcase_62 | AC | 357 ms
79,176 KB |
testcase_63 | AC | 347 ms
79,132 KB |
testcase_64 | AC | 299 ms
79,112 KB |
testcase_65 | AC | 306 ms
78,888 KB |
testcase_66 | AC | 344 ms
79,128 KB |
testcase_67 | AC | 357 ms
79,184 KB |
testcase_68 | AC | 317 ms
79,088 KB |
testcase_69 | AC | 339 ms
79,132 KB |
testcase_70 | AC | 383 ms
79,844 KB |
testcase_71 | AC | 417 ms
79,996 KB |
testcase_72 | AC | 403 ms
80,484 KB |
testcase_73 | AC | 358 ms
79,456 KB |
testcase_74 | AC | 425 ms
80,120 KB |
testcase_75 | AC | 139 ms
77,312 KB |
testcase_76 | AC | 156 ms
77,652 KB |
testcase_77 | AC | 156 ms
77,460 KB |
testcase_78 | AC | 354 ms
79,228 KB |
testcase_79 | AC | 346 ms
78,936 KB |
testcase_80 | AC | 366 ms
79,892 KB |
testcase_81 | AC | 232 ms
78,568 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)