結果

問題 No.2604 Initial Motion
ユーザー timitimi
提出日時 2024-01-14 17:30:50
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,555 bytes
コンパイル時間 306 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 95,104 KB
最終ジャッジ日時 2024-09-28 02:02:45
合計ジャッジ時間 8,414 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
60,288 KB
testcase_01 AC 48 ms
54,528 KB
testcase_02 AC 58 ms
64,128 KB
testcase_03 AC 281 ms
77,804 KB
testcase_04 AC 289 ms
77,844 KB
testcase_05 AC 293 ms
77,828 KB
testcase_06 AC 293 ms
77,908 KB
testcase_07 AC 294 ms
78,120 KB
testcase_08 AC 289 ms
77,752 KB
testcase_09 AC 286 ms
78,036 KB
testcase_10 AC 306 ms
78,160 KB
testcase_11 AC 282 ms
77,948 KB
testcase_12 AC 297 ms
78,028 KB
testcase_13 TLE -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque  
from sys import stdin
K,N,M=map(int, stdin.readline().split())
A=list(map(int, stdin.readline().split()))
B=list(map(int, stdin.readline().split()))

class MinCostFlow:
    def __init__(self, n):
        self.n = n
        self.G = [[] for i in range(n)]

    def addEdge(self, f, t, cap, cost):
        # [to, cap, cost, rev]
        self.G[f].append([t, cap, cost, len(self.G[t])])
        self.G[t].append([f, 0, -cost, len(self.G[f])-1])

    def minCostFlow(self, s, t, f):
        n = self.n
        G = self.G
        prevv = [0]*n; preve = [0]*n
        INF = 10**9+7

        res = 0
        while f:
            dist = [INF]*n
            dist[s] = 0
            update = 1
            while update:
                update = 0
                for v in range(n):
                    if dist[v] == INF:
                        continue
                    gv = G[v]
                    for i in range(len(gv)):
                        to, cap, cost, rev = gv[i]
                        if cap > 0 and dist[v] + cost < dist[to]:
                            dist[to] = dist[v] + cost
                            prevv[to] = v; preve[to] = i
                            update = 1
            if dist[t] == INF:
                return -1

            d = f; v = t
            while v != s:
                d = min(d, G[prevv[v]][preve[v]][1])
                v = prevv[v]
            f -= d
            res += d * dist[t]
            v = t
            while v != s:
                e = G[prevv[v]][preve[v]]
                e[1] -= d
                G[v][e[3]][1] += d
                v = prevv[v]
        return res

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 addedge(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

      
graph =MinCostFlow(N+2)
for i in range(K):
  t=A[i]
  graph.addedge(0,t,1,0)

for i in range(N):
  t=B[i]
  if t!=0:
    graph.addedge(i+1,N+1,t,0)
  
for i in range(M):
  u,v,d=map(int, stdin.readline().split())
  graph.addedge(u,v,10**5,d)
  graph.addedge(v,u,10**5,d)
  
print(graph.flow(0,N+1,K))
0