結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | marroncastle |
提出日時 | 2020-11-29 20:19:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,184 ms / 3,000 ms |
コード長 | 1,792 bytes |
コンパイル時間 | 253 ms |
コンパイル使用メモリ | 86,952 KB |
実行使用メモリ | 219,164 KB |
最終ジャッジ日時 | 2023-10-11 02:35:52 |
合計ジャッジ時間 | 37,601 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,548 KB |
testcase_01 | AC | 75 ms
71,524 KB |
testcase_02 | AC | 1,019 ms
207,788 KB |
testcase_03 | AC | 991 ms
192,660 KB |
testcase_04 | AC | 1,155 ms
213,552 KB |
testcase_05 | AC | 1,022 ms
210,668 KB |
testcase_06 | AC | 1,007 ms
202,932 KB |
testcase_07 | AC | 1,041 ms
204,888 KB |
testcase_08 | AC | 979 ms
194,472 KB |
testcase_09 | AC | 961 ms
196,748 KB |
testcase_10 | AC | 914 ms
194,020 KB |
testcase_11 | AC | 1,171 ms
207,560 KB |
testcase_12 | AC | 1,071 ms
207,020 KB |
testcase_13 | AC | 1,025 ms
209,460 KB |
testcase_14 | AC | 985 ms
196,896 KB |
testcase_15 | AC | 1,007 ms
197,748 KB |
testcase_16 | AC | 1,112 ms
213,540 KB |
testcase_17 | AC | 1,022 ms
211,292 KB |
testcase_18 | AC | 1,154 ms
199,792 KB |
testcase_19 | AC | 1,129 ms
204,584 KB |
testcase_20 | AC | 1,095 ms
200,964 KB |
testcase_21 | AC | 1,022 ms
207,860 KB |
testcase_22 | AC | 1,113 ms
204,636 KB |
testcase_23 | AC | 992 ms
209,512 KB |
testcase_24 | AC | 1,040 ms
203,592 KB |
testcase_25 | AC | 1,140 ms
213,504 KB |
testcase_26 | AC | 1,016 ms
204,980 KB |
testcase_27 | AC | 1,069 ms
206,648 KB |
testcase_28 | AC | 892 ms
203,472 KB |
testcase_29 | AC | 1,068 ms
212,056 KB |
testcase_30 | AC | 1,184 ms
212,876 KB |
testcase_31 | AC | 1,113 ms
211,576 KB |
testcase_32 | AC | 77 ms
71,600 KB |
testcase_33 | AC | 508 ms
202,708 KB |
testcase_34 | AC | 1,162 ms
219,164 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 import sys,os,io input = sys.stdin.readline #input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline 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))