結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | persimmon-persimmon |
提出日時 | 2021-02-15 19:55:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,401 ms / 3,000 ms |
コード長 | 1,564 bytes |
コンパイル時間 | 347 ms |
コンパイル使用メモリ | 87,072 KB |
実行使用メモリ | 220,204 KB |
最終ジャッジ日時 | 2023-09-30 18:15:16 |
合計ジャッジ時間 | 44,282 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 84 ms
71,024 KB |
testcase_01 | AC | 86 ms
71,376 KB |
testcase_02 | AC | 1,311 ms
210,324 KB |
testcase_03 | AC | 1,286 ms
195,604 KB |
testcase_04 | AC | 1,376 ms
216,016 KB |
testcase_05 | AC | 1,198 ms
212,960 KB |
testcase_06 | AC | 1,201 ms
204,448 KB |
testcase_07 | AC | 1,236 ms
207,268 KB |
testcase_08 | AC | 1,155 ms
196,576 KB |
testcase_09 | AC | 1,131 ms
198,720 KB |
testcase_10 | AC | 1,098 ms
195,824 KB |
testcase_11 | AC | 1,394 ms
210,348 KB |
testcase_12 | AC | 1,247 ms
210,548 KB |
testcase_13 | AC | 1,216 ms
211,712 KB |
testcase_14 | AC | 1,129 ms
198,884 KB |
testcase_15 | AC | 1,199 ms
200,284 KB |
testcase_16 | AC | 1,311 ms
216,452 KB |
testcase_17 | AC | 1,257 ms
214,420 KB |
testcase_18 | AC | 1,321 ms
202,808 KB |
testcase_19 | AC | 1,237 ms
205,924 KB |
testcase_20 | AC | 1,168 ms
202,968 KB |
testcase_21 | AC | 1,211 ms
210,792 KB |
testcase_22 | AC | 1,314 ms
207,024 KB |
testcase_23 | AC | 1,205 ms
212,676 KB |
testcase_24 | AC | 1,228 ms
204,500 KB |
testcase_25 | AC | 1,344 ms
216,084 KB |
testcase_26 | AC | 1,175 ms
207,368 KB |
testcase_27 | AC | 1,253 ms
208,524 KB |
testcase_28 | AC | 1,071 ms
206,408 KB |
testcase_29 | AC | 1,265 ms
214,372 KB |
testcase_30 | AC | 1,401 ms
215,328 KB |
testcase_31 | AC | 1,286 ms
214,564 KB |
testcase_32 | AC | 82 ms
71,096 KB |
testcase_33 | AC | 577 ms
205,540 KB |
testcase_34 | AC | 1,311 ms
220,204 KB |
ソースコード
# 最小費用流 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, cost, None] backward = forward[3] = [fr, 0, -cost, forward] self.G[fr].append(forward) self.G[to].append(backward) def flow(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 None 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 e[3][1] += d v = prv_v[v] return res n,m=map(int,input().split()) abcd=[list(map(int,input().split())) for _ in range(m)] mcf=MinCostFlow(n) for a,b,c,d in abcd: a,b=a-1,b-1 mcf.add_edge(a,b,1,c) mcf.add_edge(b,a,1,c) mcf.add_edge(a,b,1,d) mcf.add_edge(b,a,1,d) print(mcf.flow(0,n-1,2))