結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | marroncastle |
提出日時 | 2020-11-29 20:19:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,266 ms / 3,000 ms |
コード長 | 1,687 bytes |
コンパイル時間 | 677 ms |
コンパイル使用メモリ | 87,224 KB |
実行使用メモリ | 219,784 KB |
最終ジャッジ日時 | 2023-10-11 02:35:13 |
合計ジャッジ時間 | 38,174 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
71,384 KB |
testcase_01 | AC | 74 ms
71,508 KB |
testcase_02 | AC | 1,110 ms
208,648 KB |
testcase_03 | AC | 1,030 ms
194,204 KB |
testcase_04 | AC | 1,211 ms
212,872 KB |
testcase_05 | AC | 1,082 ms
212,280 KB |
testcase_06 | AC | 1,075 ms
201,916 KB |
testcase_07 | AC | 1,105 ms
204,416 KB |
testcase_08 | AC | 1,052 ms
195,932 KB |
testcase_09 | AC | 1,025 ms
195,700 KB |
testcase_10 | AC | 976 ms
194,248 KB |
testcase_11 | AC | 1,266 ms
207,868 KB |
testcase_12 | AC | 1,130 ms
206,612 KB |
testcase_13 | AC | 1,114 ms
210,328 KB |
testcase_14 | AC | 1,052 ms
196,400 KB |
testcase_15 | AC | 1,079 ms
198,608 KB |
testcase_16 | AC | 1,175 ms
213,436 KB |
testcase_17 | AC | 1,104 ms
212,472 KB |
testcase_18 | AC | 1,179 ms
200,216 KB |
testcase_19 | AC | 1,145 ms
203,432 KB |
testcase_20 | AC | 1,105 ms
200,780 KB |
testcase_21 | AC | 1,079 ms
208,808 KB |
testcase_22 | AC | 1,169 ms
204,684 KB |
testcase_23 | AC | 1,049 ms
211,112 KB |
testcase_24 | AC | 1,104 ms
202,460 KB |
testcase_25 | AC | 1,210 ms
213,040 KB |
testcase_26 | AC | 1,085 ms
204,108 KB |
testcase_27 | AC | 1,120 ms
206,356 KB |
testcase_28 | AC | 947 ms
205,164 KB |
testcase_29 | AC | 1,133 ms
212,008 KB |
testcase_30 | AC | 1,235 ms
212,500 KB |
testcase_31 | AC | 1,154 ms
211,636 KB |
testcase_32 | AC | 74 ms
71,444 KB |
testcase_33 | AC | 550 ms
203,032 KB |
testcase_34 | AC | 1,206 ms
219,784 KB |
ソースコード
# Dijkstra O(FElog(V)) from heapq import heappush, heappop class MinCostFlow: INF = 10**18 def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap, cost): forward = [to, cap, 0, cost, None] backward = forward[4] = [fr, 0, 0, -cost, forward] self.G[fr].append(forward) self.G[to].append(backward) def minCostFlow(self, s, t, f): N = self.N; G = self.G INF = MinCostFlow.INF res = 0 H = [0]*N prv_v = [0]*N prv_e = [None]*N d0 = [INF]*N dist = [INF]*N while f: dist[:] = d0 dist[s] = 0 que = [(0, s)] while que: c, v = heappop(que) if dist[v] < c: continue r0 = dist[v] + H[v] for e in G[v]: w, cap, _, cost, _ = e if cap > 0 and r0 + cost - H[w] < dist[w]: dist[w] = r = r0 + cost - H[w] prv_v[w] = v; prv_e[w] = e heappush(que, (r, w)) if dist[t] == INF: return -1 for i in range(N): H[i] += dist[i] d = f; v = t while v != s: d = min(d, prv_e[v][1]) v = prv_v[v] f -= d res += d * H[t] v = t while v != s: e = prv_e[v] e[1] -= d if e[4][2]==0: e[2] += d else: e[4][2] -= d e[4][1] += d v = prv_v[v] return res n, m = map(int, input().split()) graph = MinCostFlow(n) for i in range(m): u, v, c, d = map(int, input().split()) graph.add_edge(u-1, v-1, 1, c) graph.add_edge(v-1, u-1, 1, c) graph.add_edge(u-1, v-1, 1, d) graph.add_edge(v-1, u-1, 1, d) print(graph.minCostFlow(0, n-1, 2))