結果
問題 | No.2573 moving up |
ユーザー |
|
提出日時 | 2023-12-02 16:16:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 695 ms / 2,000 ms |
コード長 | 4,365 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 82,268 KB |
実行使用メモリ | 89,728 KB |
最終ジャッジ日時 | 2024-09-27 01:27:28 |
合計ジャッジ時間 | 11,356 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 31 |
ソースコード
from typing import NamedTuple, Optional, List, Tuple, castfrom heapq import heappush, heappopclass MCFGraph:class Edge(NamedTuple):src: intdst: intcap: intflow: intcost: intclass _Edge:def __init__(self, dst: int, cap: int, cost: int) -> None:self.dst = dstself.cap = capself.cost = costself.rev: Optional[MCFGraph._Edge] = Nonedef __init__(self, n: int) -> None:self._n = nself._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._nassert 0 <= dst < self._nassert 0 <= capm = len(self._edges)e = MCFGraph._Edge(dst, cap, cost)re = MCFGraph._Edge(src, 0, -cost)e.rev = rere.rev = eself._g[src].append(e)self._g[dst].append(re)self._edges.append(e)return mdef 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._nassert 0 <= t < self._nassert s != tif flow_limit is None:flow_limit = cast(int, sum(e.cap for e in self._g[s]))dual = [0] * self._nprev: List[Optional[Tuple[int, MCFGraph._Edge]]] = [None] * self._ndef refine_dual() -> bool:pq = [(0, s)]visited = [False] * self._ndist: List[Optional[int]] = [None] * self._ndist[s] = 0while pq:dist_v, v = heappop(pq)if visited[v]:continuevisited[v] = Trueif v == t:breakdual_v = dual[v]for e in self._g[v]:w = e.dstif visited[w] or e.cap == 0:continuereduced_cost = e.cost - dual[w] + dual_vnew_dist = dist_v + reduced_costdist_w = dist[w]if dist_w is None or new_dist < dist_w:dist[w] = new_distprev[w] = v, eheappush(pq, (new_dist, w))else:return Falsedist_t = dist[t]for v in range(self._n):if visited[v]:dual[v] -= cast(int, dist_t) - cast(int, dist[v])return Trueflow = 0cost = 0prev_cost_per_flow: Optional[int] = Noneresult = [(flow, cost)]while flow < flow_limit:if not refine_dual():breakf = flow_limit - flowv = twhile prev[v] is not None:u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])f = min(f, e.cap)v = uv = twhile prev[v] is not None:u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])e.cap -= fassert e.rev is not Nonee.rev.cap += fv = uc = -dual[s]flow += fcost += f * cif c == prev_cost_per_flow:result.pop()result.append((flow, cost))prev_cost_per_flow = creturn resultH,W=map(int,input().split())gr=MCFGraph(W*2+2)big=10**5for i in range(W):x,y=map(int,input().split())x-=1y-=1for j in range(W):gr.add_edge(i+2,2+W+j,1,max(abs(x),abs(y),abs(x-y)))y-=1gr.add_edge(0,i+2,1,0)gr.add_edge(i+W+2,1,1,0)print(gr.flow(0,1)[1])