結果
問題 | No.2604 Initial Motion |
ユーザー | nikoro256 |
提出日時 | 2024-01-12 22:44:22 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,495 bytes |
コンパイル時間 | 432 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 115,144 KB |
最終ジャッジ日時 | 2024-01-12 22:45:28 |
合計ジャッジ時間 | 65,623 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
68,224 KB |
testcase_01 | AC | 64 ms
68,224 KB |
testcase_02 | AC | 74 ms
70,564 KB |
testcase_03 | AC | 286 ms
80,084 KB |
testcase_04 | AC | 276 ms
80,068 KB |
testcase_05 | AC | 270 ms
80,032 KB |
testcase_06 | AC | 246 ms
79,724 KB |
testcase_07 | AC | 250 ms
79,712 KB |
testcase_08 | AC | 267 ms
80,508 KB |
testcase_09 | AC | 239 ms
79,576 KB |
testcase_10 | AC | 278 ms
79,980 KB |
testcase_11 | AC | 253 ms
79,724 KB |
testcase_12 | AC | 255 ms
79,824 KB |
testcase_13 | AC | 2,339 ms
98,956 KB |
testcase_14 | AC | 1,929 ms
91,628 KB |
testcase_15 | AC | 1,012 ms
86,308 KB |
testcase_16 | AC | 2,359 ms
95,244 KB |
testcase_17 | AC | 2,755 ms
103,844 KB |
testcase_18 | AC | 2,539 ms
103,384 KB |
testcase_19 | AC | 2,423 ms
101,936 KB |
testcase_20 | AC | 2,188 ms
96,548 KB |
testcase_21 | AC | 1,938 ms
92,088 KB |
testcase_22 | AC | 2,422 ms
101,088 KB |
testcase_23 | AC | 2,071 ms
93,872 KB |
testcase_24 | AC | 2,466 ms
97,272 KB |
testcase_25 | TLE | - |
testcase_26 | AC | 2,185 ms
94,724 KB |
testcase_27 | AC | 1,803 ms
89,512 KB |
testcase_28 | AC | 2,071 ms
93,948 KB |
testcase_29 | AC | 2,240 ms
97,640 KB |
testcase_30 | AC | 1,901 ms
91,552 KB |
testcase_31 | AC | 2,099 ms
94,352 KB |
testcase_32 | AC | 2,529 ms
97,832 KB |
testcase_33 | TLE | - |
testcase_34 | AC | 1,445 ms
94,392 KB |
testcase_35 | AC | 2,372 ms
115,144 KB |
testcase_36 | AC | 2,320 ms
112,368 KB |
testcase_37 | AC | 963 ms
89,372 KB |
testcase_38 | AC | 138 ms
79,036 KB |
testcase_39 | AC | 144 ms
78,908 KB |
testcase_40 | AC | 2,843 ms
104,000 KB |
testcase_41 | AC | 2,843 ms
104,504 KB |
ソースコード
from typing import NamedTuple, Optional, List, Tuple, cast from heapq import heappush, heappop class MCFGraph: class Edge(NamedTuple): src: int dst: int cap: int flow: int cost: int class _Edge: def __init__(self, dst: int, cap: int, cost: int) -> None: self.dst = dst self.cap = cap self.cost = cost self.rev: Optional[MCFGraph._Edge] = None def __init__(self, n: int) -> None: self._n = n self._g: List[List[MCFGraph._Edge]] = [[] for _ in range(n)] self._edges: List[MCFGraph._Edge] = [] def add_edge(self, src: int, dst: int, cap: int, cost: int) -> int: assert 0 <= src < self._n assert 0 <= dst < self._n assert 0 <= cap m = len(self._edges) e = MCFGraph._Edge(dst, cap, cost) re = MCFGraph._Edge(src, 0, -cost) e.rev = re re.rev = e self._g[src].append(e) self._g[dst].append(re) self._edges.append(e) return m def get_edge(self, i: int) -> Edge: assert 0 <= i < len(self._edges) e = self._edges[i] re = cast(MCFGraph._Edge, e.rev) return MCFGraph.Edge( re.dst, e.dst, e.cap + re.cap, re.cap, e.cost ) def edges(self) -> List[Edge]: return [self.get_edge(i) for i in range(len(self._edges))] def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> Tuple[int, int]: return self.slope(s, t, flow_limit)[-1] def slope(self, s: int, t: int, flow_limit: Optional[int] = None) -> List[Tuple[int, int]]: assert 0 <= s < self._n assert 0 <= t < self._n assert s != t if flow_limit is None: flow_limit = cast(int, sum(e.cap for e in self._g[s])) dual = [0] * self._n prev: List[Optional[Tuple[int, MCFGraph._Edge]]] = [None] * self._n def refine_dual() -> bool: pq = [(0, s)] visited = [False] * self._n dist: List[Optional[int]] = [None] * self._n dist[s] = 0 while pq: dist_v, v = heappop(pq) if visited[v]: continue visited[v] = True if v == t: break dual_v = dual[v] for e in self._g[v]: w = e.dst if visited[w] or e.cap == 0: continue reduced_cost = e.cost - dual[w] + dual_v new_dist = dist_v + reduced_cost dist_w = dist[w] if dist_w is None or new_dist < dist_w: dist[w] = new_dist prev[w] = v, e heappush(pq, (new_dist, w)) else: return False dist_t = dist[t] for v in range(self._n): if visited[v]: dual[v] -= cast(int, dist_t) - cast(int, dist[v]) return True flow = 0 cost = 0 prev_cost_per_flow: Optional[int] = None result = [(flow, cost)] while flow < flow_limit: if not refine_dual(): break f = flow_limit - flow v = t while prev[v] is not None: u, e = cast(Tuple[int, MCFGraph._Edge], prev[v]) f = min(f, e.cap) v = u v = t while prev[v] is not None: u, e = cast(Tuple[int, MCFGraph._Edge], prev[v]) e.cap -= f assert e.rev is not None e.rev.cap += f v = u c = -dual[s] flow += f cost += f * c if c == prev_cost_per_flow: result.pop() result.append((flow, cost)) prev_cost_per_flow = c return result K,N,M=map(int,input().split()) A=list(map(int,input().split())) B=list(map(int,input().split())) #初期化 mf=MCFGraph(N+2) for i in range(K): mf.add_edge(0,A[i],1,0) for i in range(N): mf.add_edge(i+1,N+1,B[i],0) for i in range(M): u,v,d=map(int,input().split()) mf.add_edge(u,v,10**9,d) mf.add_edge(v,u,10**9,d) #flowを流す。返り値は(流れの量,費用)。O(F(N+M)log(N+M)) print(mf.flow(0,N+1,K)[1])