結果

問題 No.654 Air E869120
ユーザー kamojirokamojiro
提出日時 2020-06-11 00:30:12
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
RE  
実行時間 -
コード長 2,504 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 13,184 KB
実行使用メモリ 11,904 KB
最終ジャッジ日時 2024-06-23 20:43:06
合計ジャッジ時間 2,598 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 36 ms
11,776 KB
testcase_31 AC 38 ms
11,648 KB
testcase_32 AC 37 ms
11,776 KB
testcase_33 AC 38 ms
11,776 KB
testcase_34 AC 37 ms
11,648 KB
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
INF = 10**18

def dfs_for_Ford_Fulkerson(N,E,capacity,s,g,flowing):
    stack = [(s,INF)]
    root = [0]*N
    root[s] = -1
    V = [False]*N
    V[s] = True
    while stack:
        u, flow = stack.pop()
        for v in E[u]:
            if not V[v] and capacity[(u,v)] > 0:
                root[v] = u
                V[v] = True
                if v == g:
                    if capacity[(u,v)] < flow:
                        flow = capacity[(u,v)]
                    break
                stack.append((v, min(flow, capacity[(u,v)])))
        else:
            continue
        break
    else:
        return False
    now = g
    while now != s:
        before = root[now]
        capacity[(before, now)] -= flow
        capacity[(now, before)] += flow
        now = before
    flowing[0] += flow
    return True

def Ford_Fulkerson(N,E,capacity, s, g):
    flowing = [0]
    while dfs_for_Ford_Fulkerson(N,E,capacity,s,g, flowing):
        pass
    return flowing[0]

def main():
    N, M, D = map( int, input().split())
    m = map(int, read().split())
    U, V, P, Q, W = zip(*zip(m, m, m, m, m))
    # U, V, P, Q, W = [], [], [], [], []
    # for _ in range(M):
    #     u,v,p,q,w = map( int, input().split())
    #     U.append(u)
    #     V.append(v)
    #     P.append(p)
    #     Q.append(q)
    #     W.append(w)
    X = [(u << 32) + p for u, p in zip(U, P)]
    Y = [(v << 32) + q + D for v, q in zip(V, Q)]
    nodes = sorted(set(X + Y))
    ind = {x: i for i, x in enumerate(nodes)}
    L = len(nodes)
    source = L
    sink = L + 1
    G = [[] for _ in range(L+2)]
    capacity = defaultdict( int)
    u, t = divmod(nodes[0], 1 << 32)
    if u == 1:
        G[source].append(0)
        capacity[(source, 0)] = INF
        G[0].append(source)
    u, t = divmod(nodes[-1], 1 << 32)
    if u == N:
        G[L-1].append(sink)
        capacity[(L-1, sink)] = INF
        G[sink].append(L-1)
    for i, (x, y) in enumerate(zip(nodes, nodes[1:])):
        if x >> 32 == y >> 32:
            G[i].append(i+1)
            capacity[(i, i+1)] = INF
            G[i+1].append(i)
    for x, y, w in zip(X, Y, W):
        G[ind[x]].append(ind[y])
        capacity[(ind[x], ind[y])] += w
        G[ind[y]].append(ind[x])
    print( Ford_Fulkerson(L+2,G,capacity,source,sink))
    
if __name__ == '__main__':
    main()
0