結果
問題 | No.1288 yuki collection |
ユーザー | chocorusk |
提出日時 | 2020-09-21 22:58:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,332 ms / 5,000 ms |
コード長 | 2,955 bytes |
コンパイル時間 | 275 ms |
コンパイル使用メモリ | 86,644 KB |
実行使用メモリ | 86,216 KB |
最終ジャッジ日時 | 2023-09-10 13:44:03 |
合計ジャッジ時間 | 31,277 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,024 KB |
testcase_01 | AC | 76 ms
71,156 KB |
testcase_02 | AC | 79 ms
71,096 KB |
testcase_03 | AC | 122 ms
77,200 KB |
testcase_04 | AC | 76 ms
71,104 KB |
testcase_05 | AC | 77 ms
71,204 KB |
testcase_06 | AC | 85 ms
75,560 KB |
testcase_07 | AC | 76 ms
70,968 KB |
testcase_08 | AC | 139 ms
77,836 KB |
testcase_09 | AC | 133 ms
77,336 KB |
testcase_10 | AC | 147 ms
77,820 KB |
testcase_11 | AC | 117 ms
77,060 KB |
testcase_12 | AC | 128 ms
77,232 KB |
testcase_13 | AC | 1,135 ms
84,868 KB |
testcase_14 | AC | 1,139 ms
85,284 KB |
testcase_15 | AC | 985 ms
83,396 KB |
testcase_16 | AC | 947 ms
84,216 KB |
testcase_17 | AC | 1,074 ms
84,748 KB |
testcase_18 | AC | 1,313 ms
85,900 KB |
testcase_19 | AC | 1,136 ms
85,036 KB |
testcase_20 | AC | 1,241 ms
81,824 KB |
testcase_21 | AC | 1,176 ms
82,004 KB |
testcase_22 | AC | 1,205 ms
86,216 KB |
testcase_23 | AC | 1,332 ms
85,844 KB |
testcase_24 | AC | 1,178 ms
84,904 KB |
testcase_25 | AC | 1,062 ms
81,528 KB |
testcase_26 | AC | 1,307 ms
86,108 KB |
testcase_27 | AC | 948 ms
82,528 KB |
testcase_28 | AC | 801 ms
83,372 KB |
testcase_29 | AC | 750 ms
82,864 KB |
testcase_30 | AC | 441 ms
80,448 KB |
testcase_31 | AC | 444 ms
80,520 KB |
testcase_32 | AC | 456 ms
80,612 KB |
testcase_33 | AC | 1,142 ms
81,808 KB |
testcase_34 | AC | 1,207 ms
86,024 KB |
testcase_35 | AC | 1,140 ms
85,136 KB |
testcase_36 | AC | 1,159 ms
82,800 KB |
testcase_37 | AC | 1,116 ms
82,044 KB |
testcase_38 | AC | 725 ms
80,392 KB |
testcase_39 | AC | 735 ms
80,396 KB |
testcase_40 | AC | 335 ms
78,368 KB |
testcase_41 | AC | 75 ms
71,168 KB |
testcase_42 | AC | 76 ms
71,288 KB |
ソースコード
import heapq class MinCostFlow: def __init__(self, n, neg=False): self.n=n self.g=[[] for _ in range(n)] self.h=[0]*n self.neg=neg def add_edge(self, frm, to, cap, cost): g=self.g g[frm].append([to, cap, cost, len(g[to])]) g[to].append([frm, 0, -cost, len(g[frm])-1]) def bellman_ford(self, s, t, prevv, preve): n=self.n g=self.g h=self.h INF=10**18 for x in range(n): h[x]=INF h[s]=0 for _ in range(n-1): for x in range(n): for i, e in enumerate(g[x]): if e[1]==0: continue to, cost=e[0], e[2] if h[to]>h[x]+cost: h[to]=h[x]+cost prevv[to]=x preve[to]=i def flow(self, s, t, f): res=0 n=self.n g=self.g h=self.h INF=10**18 LOG=13 #n<2**LOG prevv=[0]*n preve=[0]*n while f>0: if self.neg: self.neg=False self.bellman_ford(s, t, prevv, preve) if h[t]==INF: return -1 else: que=[] dist=[INF]*n dist[s]=0 heapq.heappush(que, s) while que: p=heapq.heappop(que) v=(p&((1<<LOG)-1)) if dist[v]<(p>>LOG): continue for i, e in enumerate(g[v]): if e[1]==0: continue to, cost=e[0], e[2] if dist[to]>dist[v]+cost+h[v]-h[to]: dist[to]=dist[v]+cost+h[v]-h[to] prevv[to]=v preve[to]=i heapq.heappush(que, (dist[to]<<LOG)^to) for i, d in enumerate(dist): h[i]+=d if dist[t]==INF: return -1 d=f v=t while v!=s: d=min(d, g[prevv[v]][preve[v]][1]) v=prevv[v] f-=d res+=d*h[t] v=t while v!=s: g[prevv[v]][preve[v]][1]-=d rev=g[prevv[v]][preve[v]][3] g[v][rev][1]+=d v=prevv[v] return res n=int(input()) s=input() v=list(map(int, input().split())) start, end=n+1, n mcf=MinCostFlow(n+2, True) s0="yuki" idx=[n+1]*5 idx[4]=n for i in range(n-1, -1, -1): k=s0.find(s[i]) if idx[k]<=n: mcf.add_edge(i, idx[k], n//4, 0) if idx[k+1]<=n: mcf.add_edge(i, idx[k+1], 1, -v[i]) idx[k]=i if idx[0]<=n: mcf.add_edge(start, idx[0], n//4, 0) mcf.add_edge(start, end, n//4, 0) print(-mcf.flow(start, end, n//4))