結果

問題 No.1301 Strange Graph Shortest Path
ユーザー ShirotsumeShirotsume
提出日時 2023-02-17 21:06:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,363 ms / 3,000 ms
コード長 2,056 bytes
コンパイル時間 1,098 ms
コンパイル使用メモリ 86,472 KB
実行使用メモリ 212,660 KB
最終ジャッジ日時 2023-09-26 18:13:57
合計ジャッジ時間 41,554 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 96 ms
71,288 KB
testcase_01 AC 95 ms
71,324 KB
testcase_02 AC 1,218 ms
201,420 KB
testcase_03 AC 1,102 ms
187,648 KB
testcase_04 AC 1,268 ms
207,444 KB
testcase_05 AC 1,171 ms
205,136 KB
testcase_06 AC 1,140 ms
196,680 KB
testcase_07 AC 1,173 ms
199,428 KB
testcase_08 AC 1,103 ms
189,468 KB
testcase_09 AC 1,084 ms
190,196 KB
testcase_10 AC 1,062 ms
188,452 KB
testcase_11 AC 1,363 ms
200,008 KB
testcase_12 AC 1,184 ms
200,556 KB
testcase_13 AC 1,159 ms
203,032 KB
testcase_14 AC 1,097 ms
189,580 KB
testcase_15 AC 1,094 ms
192,508 KB
testcase_16 AC 1,210 ms
207,304 KB
testcase_17 AC 1,154 ms
206,196 KB
testcase_18 AC 1,258 ms
193,772 KB
testcase_19 AC 1,195 ms
197,856 KB
testcase_20 AC 1,129 ms
194,936 KB
testcase_21 AC 1,124 ms
202,256 KB
testcase_22 AC 1,224 ms
197,816 KB
testcase_23 AC 1,110 ms
203,708 KB
testcase_24 AC 1,154 ms
197,156 KB
testcase_25 AC 1,269 ms
205,856 KB
testcase_26 AC 1,209 ms
198,760 KB
testcase_27 AC 1,188 ms
200,596 KB
testcase_28 AC 970 ms
198,196 KB
testcase_29 AC 1,148 ms
205,552 KB
testcase_30 AC 1,295 ms
206,360 KB
testcase_31 AC 1,228 ms
204,756 KB
testcase_32 AC 96 ms
71,172 KB
testcase_33 AC 545 ms
195,252 KB
testcase_34 AC 1,282 ms
212,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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))
0