結果

問題 No.1288 yuki collection
ユーザー persimmon-persimmon
提出日時 2021-02-17 09:31:42
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,127 bytes
コンパイル時間 332 ms
コンパイル使用メモリ 82,160 KB
実行使用メモリ 90,436 KB
最終ジャッジ日時 2024-09-13 20:00:48
合計ジャッジ時間 24,796 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25 WA * 5 TLE * 1 -- * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input=sys.stdin.readline
# 最小費用流
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 res
        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 main1(n,s,v):
  mcf=MinCostFlow(n+2)
  inf=10**10
  # n->n+1
  for i in range(n):
    if s[i]=='y':
      mcf.add_edge(n,i,inf,0)
      break
  
  for i in range(n):
    if s[i]=='i':
      mcf.add_edge(i,n+1,1,-v[i])
    for j in range(i+1,n):
      if s[i]==s[j]:
        mcf.add_edge(i,j,inf,0)
        break
    for j in range(i+1,n):
      # j<i:
      if s[i]=='y' and s[j]=='u':
        mcf.add_edge(i,j,1,-v[i])
        break
      elif s[i]=='u' and s[j]=='k':
        mcf.add_edge(i,j,1,-v[i])
        break
      elif s[i]=='k' and s[j]=='i':
        mcf.add_edge(i,j,1,-v[i])
        break
  return -mcf.flow(n,n+1,501)

if __name__=='__main__':
  n=int(input())
  s=list(input())
  v=list(map(int,input().split()))
  ret1=main1(n,s,v)
  print(ret1)
0