結果

問題 No.2604 Initial Motion
ユーザー miya145592miya145592
提出日時 2024-01-13 01:42:45
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,204 bytes
コンパイル時間 187 ms
コンパイル使用メモリ 82,160 KB
実行使用メモリ 91,752 KB
最終ジャッジ日時 2024-09-28 01:04:16
合計ジャッジ時間 17,242 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
54,748 KB
testcase_01 AC 38 ms
52,964 KB
testcase_02 AC 38 ms
53,916 KB
testcase_03 AC 227 ms
77,664 KB
testcase_04 AC 216 ms
77,520 KB
testcase_05 AC 251 ms
78,304 KB
testcase_06 AC 211 ms
77,712 KB
testcase_07 AC 218 ms
77,548 KB
testcase_08 AC 224 ms
77,668 KB
testcase_09 AC 219 ms
77,176 KB
testcase_10 AC 246 ms
78,280 KB
testcase_11 AC 224 ms
77,760 KB
testcase_12 AC 215 ms
77,428 KB
testcase_13 AC 2,939 ms
88,248 KB
testcase_14 AC 1,584 ms
83,296 KB
testcase_15 AC 1,221 ms
82,576 KB
testcase_16 AC 2,263 ms
86,860 KB
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 2,219 ms
86,480 KB
testcase_21 AC 1,732 ms
83,808 KB
testcase_22 TLE -
testcase_23 AC 1,826 ms
84,484 KB
testcase_24 AC 2,806 ms
87,436 KB
testcase_25 TLE -
testcase_26 AC 2,144 ms
85,512 KB
testcase_27 AC 1,455 ms
82,176 KB
testcase_28 AC 1,974 ms
85,016 KB
testcase_29 AC 2,903 ms
88,920 KB
testcase_30 AC 1,520 ms
83,184 KB
testcase_31 AC 2,233 ms
85,552 KB
testcase_32 AC 2,079 ms
83,844 KB
testcase_33 AC 65 ms
74,472 KB
testcase_34 AC 2,045 ms
89,132 KB
testcase_35 AC 1,801 ms
88,852 KB
testcase_36 AC 1,795 ms
86,740 KB
testcase_37 AC 96 ms
78,452 KB
testcase_38 AC 114 ms
77,292 KB
testcase_39 AC 118 ms
77,196 KB
testcase_40 AC 1,435 ms
86,160 KB
testcase_41 AC 1,456 ms
86,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# https://tjkendev.github.io/procon-library/python/min_cost_flow/primal-dual.html
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
    
import sys
input = sys.stdin.readline
K, N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
MCF = MinCostFlow(N+2)
INF = 10**16
for _ in range(M):
    u, v, d = map(int, input().split())
    MCF.add_edge(u, v, INF, d)
    MCF.add_edge(v, u, INF, d)
C = [0 for _ in range(N)]
for a in A:
    a-=1
    C[a]+=1
for i in range(N):
    if C[i]>0:
        MCF.add_edge(0, i+1, C[i], 0)
    if B[i]>0:
        MCF.add_edge(i+1, N+1, B[i], 0)
ans = MCF.flow(0, N+1, K)
print(ans)
0