結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2021-03-09 11:16:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,123 ms / 3,000 ms |
コード長 | 3,655 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 215,340 KB |
最終ジャッジ日時 | 2024-04-19 09:23:14 |
合計ジャッジ時間 | 32,176 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
53,120 KB |
testcase_01 | AC | 47 ms
53,120 KB |
testcase_02 | AC | 952 ms
207,316 KB |
testcase_03 | AC | 815 ms
193,192 KB |
testcase_04 | AC | 1,014 ms
214,156 KB |
testcase_05 | AC | 942 ms
211,368 KB |
testcase_06 | AC | 995 ms
204,712 KB |
testcase_07 | AC | 1,009 ms
204,776 KB |
testcase_08 | AC | 875 ms
194,564 KB |
testcase_09 | AC | 788 ms
196,104 KB |
testcase_10 | AC | 988 ms
194,632 KB |
testcase_11 | AC | 964 ms
206,900 KB |
testcase_12 | AC | 806 ms
207,120 KB |
testcase_13 | AC | 834 ms
207,112 KB |
testcase_14 | AC | 1,019 ms
197,952 KB |
testcase_15 | AC | 763 ms
198,152 KB |
testcase_16 | AC | 1,093 ms
213,476 KB |
testcase_17 | AC | 1,051 ms
211,752 KB |
testcase_18 | AC | 977 ms
200,528 KB |
testcase_19 | AC | 755 ms
202,536 KB |
testcase_20 | AC | 963 ms
202,664 KB |
testcase_21 | AC | 1,053 ms
207,812 KB |
testcase_22 | AC | 1,091 ms
207,568 KB |
testcase_23 | AC | 738 ms
208,308 KB |
testcase_24 | AC | 945 ms
204,728 KB |
testcase_25 | AC | 1,083 ms
213,004 KB |
testcase_26 | AC | 1,057 ms
205,092 KB |
testcase_27 | AC | 763 ms
208,672 KB |
testcase_28 | AC | 769 ms
202,172 KB |
testcase_29 | AC | 1,123 ms
215,252 KB |
testcase_30 | AC | 1,028 ms
211,876 KB |
testcase_31 | AC | 1,016 ms
214,560 KB |
testcase_32 | AC | 47 ms
53,248 KB |
testcase_33 | AC | 552 ms
205,212 KB |
testcase_34 | AC | 859 ms
215,340 KB |
ソースコード
import sys input = sys.stdin.readline from heapq import heappush, heappop class mincostflow: 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 class _edge: def __init__(self, to, rev, cap, cost): self.to = to self.rev = rev self.cap = cap self.cost = cost def __init__(self, n): self.n = n self.pos = [] self.g = [[] for i in range(n)] def add_edge(self, from_, to, cap, cost): 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 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.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost) def edges(self): result = [] for i in range(len(self.pos)): result.append(self.get_edge(i)) return result def slope(self, s, t, flow_limit=10**20, inf=10**20): dual = [0]*self.n dist = [inf]*self.n pv = [-1]*self.n pe = [-1]*self.n vis = [False]*self.n def _dual_ref(): nonlocal dual, dist, pv, pe, vis dist = [inf]*self.n pv = [-1]*self.n pe = [-1]*self.n vis = [False]*self.n que = [(0,s)] dist[s] = 0 while que: _,v = heappop(que) if vis[v]: continue vis[v] = True if v == t: break for i in range(len(self.g[v])): e = self.g[v][i] if vis[e.to] or e.cap == 0: continue cost = e.cost - dual[e.to] + dual[v] if dist[e.to] > dist[v] + cost: dist[e.to] = dist[v] + cost pv[e.to] = v pe[e.to] = i heappush(que, (dist[e.to],e.to)) if not vis[t]: return False for v in range(self.n): if not vis[v]: continue dual[v] -= dist[t] - dist[v] return True flow = 0 cost = 0 prev_cost = -1 result = [(flow, cost)] while flow < flow_limit: if not _dual_ref(): break c = flow_limit - flow v = t while v != s: c = min(c, self.g[pv[v]][pe[v]].cap) v = pv[v] v = t while v != s: e = self.g[pv[v]][pe[v]] e.cap -= c self.g[v][e.rev].cap += c v = pv[v] d = -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=10**20): return self.slope(s, t, flow_limit)[-1] n,m = map(int,input().split()) g = mincostflow(n+1) for i in range(m): u,v,c,d = map(int,input().split()) g.add_edge(u,v,1,c) g.add_edge(u,v,1,d) g.add_edge(v,u,1,c) g.add_edge(v,u,1,d) print(g.flow(1,n,2)[1])