結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | Shirotsume |
提出日時 | 2023-02-17 21:06:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,132 ms / 3,000 ms |
コード長 | 2,056 bytes |
コンパイル時間 | 697 ms |
コンパイル使用メモリ | 81,916 KB |
実行使用メモリ | 210,228 KB |
最終ジャッジ日時 | 2024-07-19 12:12:08 |
合計ジャッジ時間 | 34,281 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
55,400 KB |
testcase_01 | AC | 40 ms
55,972 KB |
testcase_02 | AC | 903 ms
199,744 KB |
testcase_03 | AC | 881 ms
186,092 KB |
testcase_04 | AC | 1,077 ms
204,380 KB |
testcase_05 | AC | 1,009 ms
202,964 KB |
testcase_06 | AC | 985 ms
195,008 KB |
testcase_07 | AC | 968 ms
196,424 KB |
testcase_08 | AC | 899 ms
187,644 KB |
testcase_09 | AC | 883 ms
188,312 KB |
testcase_10 | AC | 827 ms
186,812 KB |
testcase_11 | AC | 1,098 ms
199,448 KB |
testcase_12 | AC | 993 ms
198,640 KB |
testcase_13 | AC | 962 ms
200,932 KB |
testcase_14 | AC | 899 ms
188,032 KB |
testcase_15 | AC | 935 ms
190,412 KB |
testcase_16 | AC | 1,084 ms
205,120 KB |
testcase_17 | AC | 1,030 ms
203,028 KB |
testcase_18 | AC | 1,057 ms
191,564 KB |
testcase_19 | AC | 1,062 ms
196,444 KB |
testcase_20 | AC | 1,015 ms
193,272 KB |
testcase_21 | AC | 971 ms
200,344 KB |
testcase_22 | AC | 1,098 ms
196,068 KB |
testcase_23 | AC | 993 ms
201,968 KB |
testcase_24 | AC | 1,002 ms
194,636 KB |
testcase_25 | AC | 1,092 ms
204,500 KB |
testcase_26 | AC | 968 ms
195,932 KB |
testcase_27 | AC | 986 ms
198,204 KB |
testcase_28 | AC | 880 ms
196,392 KB |
testcase_29 | AC | 951 ms
203,536 KB |
testcase_30 | AC | 1,112 ms
204,192 KB |
testcase_31 | AC | 1,021 ms
203,456 KB |
testcase_32 | AC | 42 ms
54,484 KB |
testcase_33 | AC | 465 ms
193,844 KB |
testcase_34 | AC | 1,132 ms
210,228 KB |
ソースコード
import sys from collections import deque, Counter input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 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 = mi() G = MinCostFlow(n) for _ in range(m): u, v, c, d = mi() 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))