結果
問題 | No.2604 Initial Motion |
ユーザー | 👑 amentorimaru |
提出日時 | 2024-01-01 19:22:10 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,304 bytes |
コンパイル時間 | 374 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 110,112 KB |
最終ジャッジ日時 | 2024-01-01 19:22:30 |
合計ジャッジ時間 | 19,171 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
94,368 KB |
testcase_01 | AC | 131 ms
87,564 KB |
testcase_02 | AC | 130 ms
87,564 KB |
testcase_03 | AC | 340 ms
89,612 KB |
testcase_04 | AC | 348 ms
89,612 KB |
testcase_05 | AC | 360 ms
89,868 KB |
testcase_06 | AC | 322 ms
89,868 KB |
testcase_07 | AC | 332 ms
89,996 KB |
testcase_08 | AC | 343 ms
89,996 KB |
testcase_09 | AC | 325 ms
89,740 KB |
testcase_10 | AC | 359 ms
90,252 KB |
testcase_11 | AC | 345 ms
89,612 KB |
testcase_12 | AC | 328 ms
89,740 KB |
testcase_13 | TLE | - |
testcase_14 | AC | 1,857 ms
95,500 KB |
testcase_15 | AC | 1,405 ms
93,848 KB |
testcase_16 | AC | 2,581 ms
98,572 KB |
testcase_17 | TLE | - |
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 | -- | - |
ソースコード
import sys from fractions import Fraction input = sys.stdin.readline def read_values(): return tuple(map(int, input().split())) def read_list(): return list(map(int, input().split())) 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 def main(): k,n,m = read_values() a = read_list() b = read_list() mcf = MinCostFlow(n+2) s=n t=n+1 ac = [0]*n for v in a: ac[v-1]+=1 for _ in range(m): u,v,d=read_values() u-=1 v-=1 mcf.add_edge(u,v,k,d) mcf.add_edge(v,u,k,d) for i in range(n): if ac[i]: mcf.add_edge(s,i,ac[i],0) if b[i]: mcf.add_edge(i,t,b[i],0) print(mcf.flow(s,t,k)) return if __name__ == "__main__": main()