結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー | opt |
提出日時 | 2020-12-08 20:40:31 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 504 ms / 2,000 ms |
コード長 | 2,462 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 81,696 KB |
実行使用メモリ | 81,332 KB |
最終ジャッジ日時 | 2023-10-20 02:12:58 |
合計ジャッジ時間 | 23,337 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,596 KB |
testcase_01 | AC | 45 ms
55,596 KB |
testcase_02 | AC | 42 ms
55,596 KB |
testcase_03 | AC | 70 ms
70,172 KB |
testcase_04 | AC | 43 ms
55,596 KB |
testcase_05 | AC | 42 ms
55,596 KB |
testcase_06 | AC | 43 ms
55,596 KB |
testcase_07 | AC | 386 ms
80,332 KB |
testcase_08 | AC | 421 ms
80,396 KB |
testcase_09 | AC | 408 ms
79,520 KB |
testcase_10 | AC | 411 ms
79,960 KB |
testcase_11 | AC | 222 ms
78,564 KB |
testcase_12 | AC | 171 ms
78,260 KB |
testcase_13 | AC | 185 ms
78,176 KB |
testcase_14 | AC | 194 ms
78,332 KB |
testcase_15 | AC | 404 ms
79,732 KB |
testcase_16 | AC | 390 ms
79,632 KB |
testcase_17 | AC | 391 ms
79,752 KB |
testcase_18 | AC | 431 ms
80,144 KB |
testcase_19 | AC | 117 ms
76,324 KB |
testcase_20 | AC | 130 ms
76,988 KB |
testcase_21 | AC | 124 ms
76,884 KB |
testcase_22 | AC | 131 ms
77,268 KB |
testcase_23 | AC | 142 ms
77,304 KB |
testcase_24 | AC | 138 ms
77,372 KB |
testcase_25 | AC | 142 ms
77,268 KB |
testcase_26 | AC | 147 ms
77,340 KB |
testcase_27 | AC | 94 ms
76,180 KB |
testcase_28 | AC | 99 ms
76,220 KB |
testcase_29 | AC | 99 ms
76,220 KB |
testcase_30 | AC | 96 ms
76,176 KB |
testcase_31 | AC | 119 ms
76,900 KB |
testcase_32 | AC | 139 ms
77,348 KB |
testcase_33 | AC | 144 ms
77,908 KB |
testcase_34 | AC | 157 ms
78,572 KB |
testcase_35 | AC | 121 ms
76,968 KB |
testcase_36 | AC | 107 ms
76,472 KB |
testcase_37 | AC | 106 ms
76,276 KB |
testcase_38 | AC | 103 ms
76,232 KB |
testcase_39 | AC | 147 ms
77,360 KB |
testcase_40 | AC | 140 ms
77,516 KB |
testcase_41 | AC | 133 ms
77,456 KB |
testcase_42 | AC | 138 ms
77,836 KB |
testcase_43 | AC | 249 ms
78,404 KB |
testcase_44 | AC | 258 ms
78,600 KB |
testcase_45 | AC | 328 ms
78,684 KB |
testcase_46 | AC | 319 ms
78,716 KB |
testcase_47 | AC | 214 ms
78,780 KB |
testcase_48 | AC | 208 ms
78,376 KB |
testcase_49 | AC | 208 ms
78,408 KB |
testcase_50 | AC | 213 ms
78,944 KB |
testcase_51 | AC | 277 ms
78,980 KB |
testcase_52 | AC | 259 ms
78,292 KB |
testcase_53 | AC | 441 ms
80,776 KB |
testcase_54 | AC | 421 ms
80,340 KB |
testcase_55 | AC | 386 ms
80,148 KB |
testcase_56 | AC | 387 ms
79,396 KB |
testcase_57 | AC | 332 ms
78,496 KB |
testcase_58 | AC | 361 ms
79,704 KB |
testcase_59 | AC | 355 ms
78,872 KB |
testcase_60 | AC | 389 ms
79,692 KB |
testcase_61 | AC | 383 ms
79,244 KB |
testcase_62 | AC | 400 ms
79,344 KB |
testcase_63 | AC | 415 ms
79,644 KB |
testcase_64 | AC | 412 ms
80,248 KB |
testcase_65 | AC | 445 ms
80,952 KB |
testcase_66 | AC | 431 ms
80,336 KB |
testcase_67 | AC | 429 ms
79,748 KB |
testcase_68 | AC | 448 ms
80,088 KB |
testcase_69 | AC | 392 ms
79,744 KB |
testcase_70 | AC | 470 ms
80,572 KB |
testcase_71 | AC | 490 ms
80,780 KB |
testcase_72 | AC | 469 ms
80,896 KB |
testcase_73 | AC | 416 ms
80,000 KB |
testcase_74 | AC | 504 ms
81,332 KB |
testcase_75 | AC | 180 ms
78,384 KB |
testcase_76 | AC | 177 ms
78,184 KB |
testcase_77 | AC | 185 ms
78,312 KB |
testcase_78 | AC | 402 ms
80,436 KB |
testcase_79 | AC | 400 ms
79,872 KB |
testcase_80 | AC | 485 ms
80,508 KB |
testcase_81 | AC | 268 ms
78,672 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) cs = [0] * (n+1) for j, (a2, b2, _, _) in enumerate(edges): if y[j] > 0: g.add_multi_edge(a2, b2, y[j], y[j]) cs[a2] += y[j] cs[b2] += y[j] for v in range(1, n+1): if v == a or v == b: g.add_edge(s, v, 2*k*n) elif cs[v] > 0: g.add_edge(s, v, cs[v]) g.add_edge(v, t, 2*k) f = g.flow(s, t) z = f // 2 - k - ysum y[i] = min(z, d) ysum += y[i] ans += c * y[i] if ysum < k*(n-1): ans = -1 print(ans)