結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | zkou |
提出日時 | 2020-11-10 21:36:37 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,370 bytes |
コンパイル時間 | 324 ms |
コンパイル使用メモリ | 82,108 KB |
実行使用メモリ | 74,268 KB |
最終ジャッジ日時 | 2024-09-13 00:45:38 |
合計ジャッジ時間 | 4,943 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
ソースコード
import sys import heapq input = sys.stdin.readline class mcf_graph_int_cost: """ 頂点数、及び、costの総和が、4294967295 (== (1 << 32) - 1) を超えない前提下での高速な実装。 どちらかが超えると動きません。ごめんなさい。 """ def __init__(self, n): self.n = n self.pos = [] self.g = [[] for _ in range(n)] def add_edge(self, from_, to, cap, cost): # assert 0 <= from_ < self.n # assert 0 <= to < self.n m = len(self.pos) self.pos.append((from_, len(self.g[from_]))) self.g[from_].append(self.__class__._edge(to, len(self.g[to]), cap, cost)) self.g[to].append(self.__class__._edge(from_, len(self.g[from_]) - 1, 0, -cost)) return m class edge: def __init__(self, from_, to, cap, flow, cost): self.from_ = from_ self.to = to self.cap = cap self.flow = flow self.cost = cost def get_edge(self, i): _e = self.g[self.pos[i][0]][self.pos[i][1]] _re = self.g[_e.to][_e.rev] return self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost) def edges(self): ret = [] for i in range(len(self.pos)): _e = self.g[self.pos[i][0]][self.pos[i][1]] _re = self.g[_e.to][_e.rev] ret.append(self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost)) return ret def _dual_ref(self, s, t): self.dist = [0xFFFFFFFFFFFFFFFF] * self.n self.pv = [-1] * self.n self.pe = [-1] * self.n self.vis = [False] * self.n que = [s] # s == (0 << 32) + s self.dist[s] = 0 while que: v = heapq.heappop(que) & 4294967295 if self.vis[v]: continue self.vis[v] = True if v == t: break for i in range(len(self.g[v])): e = self.g[v][i] if self.vis[e.to] or e.cap == 0: continue cost = e.cost - self.dual[e.to] + self.dual[v] if self.dist[e.to] > self.dist[v] + cost: self.dist[e.to] = self.dist[v] + cost self.pv[e.to] = v self.pe[e.to] = i heapq.heappush(que, ((self.dist[e.to] << 32) + e.to)) if not self.vis[t]: return False for v in range(self.n): if not self.vis[v]: continue self.dual[v] -= self.dist[t] - self.dist[v] return True def slope(self, s, t, flow_limit=0xFFFFFFFFFFFFFFFF): # assert 0 <= s < self.n # assert 0 <= t < self.n # assert s != t self.dual = [0] * self.n self.dist = [0xFFFFFFFFFFFFFFFF] * self.n self.pv = [-1] * self.n self.pe = [-1] * self.n self.vis = [False] * self.n flow = 0 cost = 0 prev_cost = -1 result = [(flow, cost)] while flow < flow_limit: if not self._dual_ref(s, t): break c = flow_limit - flow v = t while v != s: c = min(c, self.g[self.pv[v]][self.pe[v]].cap) v = self.pv[v] v = t while v != s: e = self.g[self.pv[v]][self.pe[v]] e.cap -= c self.g[v][e.rev].cap += c v = self.pv[v] d = -self.dual[s] flow += c cost += c * d if prev_cost == d: result.pop() result.append((flow, cost)) prev_cost = cost return result def flow(self, s, t, flow_limit=0xFFFFFFFFFFFFFFFF): return self.slope(s, t, flow_limit)[-1] class _edge: def __init__(self, to, rev, cap, cost): self.to = to self.rev = rev self.cap = cap self.cost = cost N, M = map(int, input().split()) g = mcf_graph(N) for i in range(M): u, v, c, d = map(int, input().split()) u -= 1 v -= 1 g.add_edge(u, v, 1, c) g.add_edge(v, u, 1, c) g.add_edge(u, v, 1, d) g.add_edge(v, u, 1, d) print(g.flow(0, N - 1, 2)[1])