結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | wolgnik |
提出日時 | 2020-11-27 23:29:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,085 ms / 3,000 ms |
コード長 | 2,835 bytes |
コンパイル時間 | 358 ms |
コンパイル使用メモリ | 86,928 KB |
実行使用メモリ | 226,664 KB |
最終ジャッジ日時 | 2023-10-10 21:46:11 |
合計ジャッジ時間 | 30,828 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,532 KB |
testcase_01 | AC | 73 ms
71,336 KB |
testcase_02 | AC | 904 ms
217,268 KB |
testcase_03 | AC | 804 ms
201,980 KB |
testcase_04 | AC | 999 ms
226,112 KB |
testcase_05 | AC | 850 ms
221,512 KB |
testcase_06 | AC | 956 ms
213,960 KB |
testcase_07 | AC | 892 ms
214,336 KB |
testcase_08 | AC | 810 ms
203,636 KB |
testcase_09 | AC | 746 ms
205,868 KB |
testcase_10 | AC | 767 ms
203,844 KB |
testcase_11 | AC | 902 ms
218,720 KB |
testcase_12 | AC | 892 ms
219,584 KB |
testcase_13 | AC | 779 ms
216,912 KB |
testcase_14 | AC | 990 ms
205,760 KB |
testcase_15 | AC | 797 ms
206,736 KB |
testcase_16 | AC | 914 ms
226,012 KB |
testcase_17 | AC | 951 ms
221,436 KB |
testcase_18 | AC | 903 ms
208,188 KB |
testcase_19 | AC | 801 ms
212,388 KB |
testcase_20 | AC | 833 ms
211,324 KB |
testcase_21 | AC | 857 ms
217,540 KB |
testcase_22 | AC | 963 ms
214,716 KB |
testcase_23 | AC | 803 ms
218,216 KB |
testcase_24 | AC | 962 ms
213,300 KB |
testcase_25 | AC | 922 ms
225,404 KB |
testcase_26 | AC | 861 ms
213,988 KB |
testcase_27 | AC | 797 ms
218,232 KB |
testcase_28 | AC | 839 ms
212,528 KB |
testcase_29 | AC | 1,085 ms
226,664 KB |
testcase_30 | AC | 971 ms
222,600 KB |
testcase_31 | AC | 923 ms
223,556 KB |
testcase_32 | AC | 76 ms
71,652 KB |
testcase_33 | AC | 567 ms
213,424 KB |
testcase_34 | AC | 834 ms
222,740 KB |
ソースコード
import sys input = sys.stdin.readline N, M = map(int, input().split()) from heapq import heappop, heappush, heapify class MinCostFlow(): def __init__(self, n): self.n = n self.graph = [[] for _ in range(n)] self.pos = [] def add_edge(self, fr, to, cap, cost): m = len(self.pos) self.pos.append((fr, len(self.graph[fr]))) self.graph[fr].append([to, len(self.graph[to]), cap, cost]) self.graph[to].append([fr, len(self.graph[fr]) - 1, 0, -cost]) return m def get_edge(self, idx): to, rev, cap, cost = self.graph[self.pos[idx][0]][self.pos[idx][1]] rev_to, rev_rev, rev_cap, rev_cost = self.graph[to][rev] return self.pos[idx][0], to, cap + rev_cap, rev_cap, cost def edges(self): for i in range(len(self.pos)): yield self.get_edge(i) def dual_ref(self, s, t): dist = [2**63 - 1] * self.n dist[s] = 0 vis = [0] * self.n self.pv = [-1] * self.n self.pe = [-1] * self.n queue = [] heappush(queue, (0, s)) while queue: k, v = heappop(queue) if vis[v]: continue vis[v] = True if v == t: break for i in range(len(self.graph[v])): to, rev, cap, cost = self.graph[v][i] if vis[to] or cap == 0: continue cost += self.dual[v] - self.dual[to] if dist[to] - dist[v] > cost: dist[to] = dist[v] + cost self.pv[to] = v self.pe[to] = i heappush(queue, (dist[to], to)) if not vis[t]: return False for v in range(self.n): if not vis[v]: continue self.dual[v] -= dist[t] - dist[v] return True def flow(self, s, t): return self.flow_with_limit(s, t, 2**63 - 1) def flow_with_limit(self, s, t, limit): return self.slope_with_limit(s, t, limit)[-1] def slope(self, s, t): return self.slope_with_limit(s, t, 2**63 - 1) def slope_with_limit(self, s, t, limit): flow = 0 cost = 0 prev_cost = -1 res = [(flow, cost)] self.dual = [0] * self.n while flow < limit: if not self.dual_ref(s, t): break c = limit - flow v = t while v != s: c = min(c, self.graph[self.pv[v]][self.pe[v]][2]) v = self.pv[v] v = t while v != s: to, rev, cap, _ = self.graph[self.pv[v]][self.pe[v]] self.graph[self.pv[v]][self.pe[v]][2] -= c self.graph[v][rev][2] += c v = self.pv[v] d = -self.dual[s] flow += c cost += c * d if prev_cost == d: res.pop() res.append((flow, cost)) prev_cost = cost return res mcf = MinCostFlow(N) edges = [] for _ in range(M): u, v, c, d = map(int, input().split()) edges.append((u, v, c, d)) mcf.add_edge(u - 1, v - 1, 1, c) mcf.add_edge(v - 1, u - 1, 1, c) mcf.add_edge(u - 1, v - 1, 1, d) mcf.add_edge(v - 1, u - 1, 1, d) print(mcf.flow_with_limit(0, N - 1, 2)[1])