結果

問題 No.654 Air E869120
コンテスト
ユーザー gr1msl3y
提出日時 2022-02-23 18:21:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 3,133 bytes
コンパイル時間 253 ms
コンパイル使用メモリ 82,784 KB
実行使用メモリ 78,976 KB
最終ジャッジ日時 2024-07-01 18:46:10
合計ジャッジ時間 5,933 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque, defaultdict


class Dinic:
    """
    Usage:
       mf = Dinic(n)
    -> mf.add_link(from, to, capacity)
    -> mf.max_flow(source, target)
    """

    def __init__(self, n):
        self.n = n
        self.links = [[] for _ in range(n)]

    def add_link(self, from_, to, capacity):
        self.links[from_].append([capacity, to, len(self.links[to])])
        self.links[to].append([0, from_, len(self.links[from_]) - 1])

    def bfs(self, s):
        depth = [-1] * self.n
        depth[s] = 0
        q = deque([s])
        while q:
            v = q.popleft()
            for cap, to, rev in self.links[v]:
                if cap > 0 and depth[to] < 0:
                    depth[to] = depth[v] + 1
                    q.append(to)
        return depth

    def dfs(self, s, t, depth, progress, link_counts):
        links = self.links
        stack = [s]

        while stack:
            v = stack[-1]
            if v == t:
                break
            for i in range(progress[v], link_counts[v]):
                progress[v] = i
                cap, to, rev = links[v][i]
                if cap == 0 or depth[v] >= depth[to] or progress[to] >= link_counts[to]:
                    continue
                stack.append(to)
                break
            else:
                progress[v] += 1
                stack.pop()
        else:
            return 0

        f = 1 << 60
        fwd_links = []
        bwd_links = []
        for v in stack[:-1]:
            cap, to, rev = link = links[v][progress[v]]
            f = min(f, cap)
            fwd_links.append(link)
            bwd_links.append(links[to][rev])

        for link in fwd_links:
            link[0] -= f

        for link in bwd_links:
            link[0] += f

        return f

    def max_flow(self, s, t):
        link_counts = list(map(len, self.links))
        flow = 0
        while True:
            depth = self.bfs(s)
            if depth[t] < 0:
                break
            progress = [0] * self.n
            current_flow = self.dfs(s, t, depth, progress, link_counts)
            while current_flow > 0:
                flow += current_flow
                current_flow = self.dfs(s, t, depth, progress, link_counts)
        return flow


N, M, d = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(M)]
B = [set() for _ in range(N+1)]
ct = 0
for u, v, p, q, w in A:
    B[u].add((p, 1))
    B[v].add((q+d, 0))

C = [{} for _ in range(N+1)]
for i, b in enumerate(B):
    B[i] = list(B[i])
    if not B[i]:
        continue
    B[i].sort()
    for t, f in B[i]:
        C[i][(t, f)] = ct
        ct += 1

mf_flow = Dinic(ct+2)
for u, v, p, q, w in A:
    inds = C[u][(p, 1)]
    indt = C[v][(q+d, 0)]
    mf_flow.add_link(inds, indt, w)

INF = 10**18
for i in range(N+1):
    for j in range(len(B[i])-1):
        mf_flow.add_link(C[i][tuple(B[i][j])], C[i][tuple(B[i][j+1])], INF)

for b in B[1]:
    mf_flow.add_link(ct, C[1][b], INF)
for b in B[N]:
    if b[1] == 0 and b[0] <= 10**9+d:
        mf_flow.add_link(C[N][b], ct+1, INF)

print(mf_flow.max_flow(ct, ct+1))
0