結果

問題 No.1301 Strange Graph Shortest Path
ユーザー hiragn
提出日時 2022-12-13 14:09:54
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,021 bytes
コンパイル時間 299 ms
コンパイル使用メモリ 12,928 KB
実行使用メモリ 137,212 KB
最終ジャッジ日時 2024-11-07 09:33:54
合計ジャッジ時間 88,944 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 31 TLE * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 = [0] * 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
def main():
    n, m = map(int, input().split())
    
    g = MinCostFlow(n)
    for _ 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(u, v, 1, d)
        g.add_edge(v, u, 1, c)
        g.add_edge(v, u, 1, d)
    print(g.flow(0, n - 1, 2))
if __name__ == "__main__":
    main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0