結果
問題 | No.1288 yuki collection |
ユーザー |
![]() |
提出日時 | 2023-10-18 21:50:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,237 ms / 5,000 ms |
コード長 | 5,417 bytes |
コンパイル時間 | 174 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 98,720 KB |
最終ジャッジ日時 | 2024-09-18 17:53:27 |
合計ジャッジ時間 | 26,758 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
import sys# sys.setrecursionlimit(200005)# sys.set_int_max_str_digits(200005)int1 = lambda x: int(x)-1pDB = lambda *x: print(*x, end="\n", file=sys.stderr)p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = -1-(-1 << 31)# inf = -1-(-1 << 63)# md = 10**9+7md = 998244353from 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 resultbase=10**9n = II()S = ["yuki".find(c) for c in SI()]vv = LI()mf = MCFGraph(n+2)s = nt = s+1ii = [[], [], [], []]for i in range(n)[::-1]:c = S[i]if c == 3:mf.add_edge(i, t, 1, base-vv[i])elif ii[c+1]:mf.add_edge(i, ii[c+1][-1], 1, base-vv[i])ii[c].append(i)for c in range(4):for i, j in zip(ii[c], ii[c][1:]):mf.add_edge(j, i, n, 0)if ii[0]: mf.add_edge(s, ii[0][-1], n, 0)mf.add_edge(s, t, n, base*4)ans = mf.flow(s, t, n//4)# for e in mf.edges():# print(e)# if e.flow:print(e.src,e.dst,-e.cost)# print(ans)print(n//4*base*4-ans[1])