結果
問題 | No.2604 Initial Motion |
ユーザー | Shirotsume |
提出日時 | 2024-01-12 22:46:49 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,188 bytes |
コンパイル時間 | 320 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 112,036 KB |
最終ジャッジ日時 | 2024-01-12 22:47:11 |
合計ジャッジ時間 | 20,049 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
94,880 KB |
testcase_01 | AC | 147 ms
88,076 KB |
testcase_02 | AC | 144 ms
88,588 KB |
testcase_03 | AC | 425 ms
91,276 KB |
testcase_04 | AC | 359 ms
90,636 KB |
testcase_05 | AC | 362 ms
90,636 KB |
testcase_06 | AC | 411 ms
91,148 KB |
testcase_07 | AC | 390 ms
91,276 KB |
testcase_08 | AC | 371 ms
90,764 KB |
testcase_09 | AC | 401 ms
90,636 KB |
testcase_10 | AC | 350 ms
90,636 KB |
testcase_11 | AC | 391 ms
90,764 KB |
testcase_12 | AC | 415 ms
91,148 KB |
testcase_13 | TLE | - |
testcase_14 | AC | 2,142 ms
96,796 KB |
testcase_15 | AC | 1,627 ms
95,116 KB |
testcase_16 | TLE | - |
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 fractions import sys, time, random from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 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 k, n, m = mi() a = li() C = Counter(a) b = li() G = MinCostFlow(n + 2) S = n T = n + 1 for i in range(n): G.add_edge(S, i, C[i + 1], 0) G.add_edge(i, T, b[i], 0) for _ in range(m): u, v, d = mi() u -= 1; v -= 1 G.add_edge(u, v, inf, d) G.add_edge(v, u, inf, d) f = G.flow(S, T, k) print(f)