結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー | opt |
提出日時 | 2020-12-08 20:41:07 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 372 ms / 2,000 ms |
コード長 | 2,462 bytes |
コンパイル時間 | 345 ms |
コンパイル使用メモリ | 12,128 KB |
実行使用メモリ | 11,236 KB |
最終ジャッジ日時 | 2023-10-20 02:13:26 |
合計ジャッジ時間 | 15,893 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
10,432 KB |
testcase_01 | AC | 31 ms
10,432 KB |
testcase_02 | AC | 32 ms
10,436 KB |
testcase_03 | AC | 34 ms
10,512 KB |
testcase_04 | AC | 30 ms
10,432 KB |
testcase_05 | AC | 31 ms
10,432 KB |
testcase_06 | AC | 30 ms
10,436 KB |
testcase_07 | AC | 222 ms
10,984 KB |
testcase_08 | AC | 256 ms
11,120 KB |
testcase_09 | AC | 321 ms
10,904 KB |
testcase_10 | AC | 321 ms
10,896 KB |
testcase_11 | AC | 73 ms
10,840 KB |
testcase_12 | AC | 64 ms
10,828 KB |
testcase_13 | AC | 58 ms
10,752 KB |
testcase_14 | AC | 64 ms
10,756 KB |
testcase_15 | AC | 296 ms
11,192 KB |
testcase_16 | AC | 300 ms
11,236 KB |
testcase_17 | AC | 246 ms
11,184 KB |
testcase_18 | AC | 312 ms
11,208 KB |
testcase_19 | AC | 46 ms
10,752 KB |
testcase_20 | AC | 49 ms
10,740 KB |
testcase_21 | AC | 45 ms
10,708 KB |
testcase_22 | AC | 45 ms
10,708 KB |
testcase_23 | AC | 48 ms
10,752 KB |
testcase_24 | AC | 49 ms
10,752 KB |
testcase_25 | AC | 48 ms
10,708 KB |
testcase_26 | AC | 48 ms
10,708 KB |
testcase_27 | AC | 41 ms
10,752 KB |
testcase_28 | AC | 41 ms
10,752 KB |
testcase_29 | AC | 41 ms
10,708 KB |
testcase_30 | AC | 41 ms
10,700 KB |
testcase_31 | AC | 45 ms
10,752 KB |
testcase_32 | AC | 50 ms
10,756 KB |
testcase_33 | AC | 46 ms
10,708 KB |
testcase_34 | AC | 49 ms
10,708 KB |
testcase_35 | AC | 43 ms
10,752 KB |
testcase_36 | AC | 42 ms
10,752 KB |
testcase_37 | AC | 42 ms
10,708 KB |
testcase_38 | AC | 42 ms
10,708 KB |
testcase_39 | AC | 48 ms
10,752 KB |
testcase_40 | AC | 48 ms
10,752 KB |
testcase_41 | AC | 46 ms
10,708 KB |
testcase_42 | AC | 44 ms
10,708 KB |
testcase_43 | AC | 165 ms
10,876 KB |
testcase_44 | AC | 166 ms
10,956 KB |
testcase_45 | AC | 269 ms
10,824 KB |
testcase_46 | AC | 259 ms
10,840 KB |
testcase_47 | AC | 122 ms
10,916 KB |
testcase_48 | AC | 112 ms
10,892 KB |
testcase_49 | AC | 106 ms
10,800 KB |
testcase_50 | AC | 112 ms
10,820 KB |
testcase_51 | AC | 174 ms
10,988 KB |
testcase_52 | AC | 169 ms
10,980 KB |
testcase_53 | AC | 300 ms
10,896 KB |
testcase_54 | AC | 303 ms
10,888 KB |
testcase_55 | AC | 291 ms
10,872 KB |
testcase_56 | AC | 302 ms
10,860 KB |
testcase_57 | AC | 329 ms
11,044 KB |
testcase_58 | AC | 325 ms
10,888 KB |
testcase_59 | AC | 262 ms
10,908 KB |
testcase_60 | AC | 280 ms
10,844 KB |
testcase_61 | AC | 365 ms
11,044 KB |
testcase_62 | AC | 333 ms
11,076 KB |
testcase_63 | AC | 372 ms
11,044 KB |
testcase_64 | AC | 294 ms
10,872 KB |
testcase_65 | AC | 320 ms
11,136 KB |
testcase_66 | AC | 362 ms
11,148 KB |
testcase_67 | AC | 338 ms
11,140 KB |
testcase_68 | AC | 336 ms
11,140 KB |
testcase_69 | AC | 300 ms
11,104 KB |
testcase_70 | AC | 366 ms
11,084 KB |
testcase_71 | AC | 355 ms
11,120 KB |
testcase_72 | AC | 350 ms
11,100 KB |
testcase_73 | AC | 295 ms
11,204 KB |
testcase_74 | AC | 352 ms
11,100 KB |
testcase_75 | AC | 57 ms
10,756 KB |
testcase_76 | AC | 57 ms
10,764 KB |
testcase_77 | AC | 58 ms
10,764 KB |
testcase_78 | AC | 277 ms
11,196 KB |
testcase_79 | AC | 302 ms
11,196 KB |
testcase_80 | AC | 300 ms
11,172 KB |
testcase_81 | AC | 138 ms
10,948 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)