結果
問題 | No.1288 yuki collection |
ユーザー | chocorusk |
提出日時 | 2020-09-21 23:00:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,540 ms / 5,000 ms |
コード長 | 3,144 bytes |
コンパイル時間 | 426 ms |
コンパイル使用メモリ | 87,132 KB |
実行使用メモリ | 97,880 KB |
最終ジャッジ日時 | 2023-09-10 13:46:49 |
合計ジャッジ時間 | 109,300 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 87 ms
75,568 KB |
testcase_01 | AC | 80 ms
71,320 KB |
testcase_02 | AC | 92 ms
76,144 KB |
testcase_03 | AC | 157 ms
77,888 KB |
testcase_04 | AC | 80 ms
71,048 KB |
testcase_05 | AC | 85 ms
74,848 KB |
testcase_06 | AC | 138 ms
77,356 KB |
testcase_07 | AC | 91 ms
76,196 KB |
testcase_08 | AC | 148 ms
77,676 KB |
testcase_09 | AC | 141 ms
77,696 KB |
testcase_10 | AC | 161 ms
78,088 KB |
testcase_11 | AC | 148 ms
77,968 KB |
testcase_12 | AC | 147 ms
78,072 KB |
testcase_13 | AC | 3,904 ms
94,168 KB |
testcase_14 | AC | 3,767 ms
92,804 KB |
testcase_15 | AC | 3,122 ms
89,824 KB |
testcase_16 | AC | 3,172 ms
89,452 KB |
testcase_17 | AC | 4,097 ms
94,768 KB |
testcase_18 | AC | 3,883 ms
93,208 KB |
testcase_19 | AC | 3,750 ms
93,328 KB |
testcase_20 | AC | 3,875 ms
94,104 KB |
testcase_21 | AC | 3,525 ms
93,792 KB |
testcase_22 | AC | 3,502 ms
93,408 KB |
testcase_23 | AC | 3,630 ms
92,780 KB |
testcase_24 | AC | 3,727 ms
93,624 KB |
testcase_25 | AC | 3,870 ms
93,552 KB |
testcase_26 | AC | 3,909 ms
94,280 KB |
testcase_27 | AC | 4,540 ms
97,328 KB |
testcase_28 | AC | 4,499 ms
97,100 KB |
testcase_29 | AC | 3,607 ms
92,848 KB |
testcase_30 | AC | 4,207 ms
97,880 KB |
testcase_31 | AC | 4,125 ms
96,924 KB |
testcase_32 | AC | 4,292 ms
97,028 KB |
testcase_33 | AC | 3,413 ms
95,688 KB |
testcase_34 | AC | 3,586 ms
92,300 KB |
testcase_35 | AC | 3,985 ms
95,464 KB |
testcase_36 | AC | 3,308 ms
94,640 KB |
testcase_37 | AC | 3,715 ms
94,384 KB |
testcase_38 | AC | 3,143 ms
92,972 KB |
testcase_39 | AC | 3,318 ms
95,972 KB |
testcase_40 | AC | 3,852 ms
95,336 KB |
testcase_41 | AC | 81 ms
71,396 KB |
testcase_42 | AC | 83 ms
71,380 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, S, T=n+1, n, n+2, n+3 mcf=MinCostFlow(n+4) mcf.add_edge(S, start, n//4, 0) mcf.add_edge(end, T, n//4, 0) ans=0 f=0 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(S, idx[k+1], 1, 0) mcf.add_edge(idx[k+1], i, 1, v[i]) mcf.add_edge(i, T, 1, 0) ans+=v[i] f+=1 idx[k]=i if idx[0]<=n: mcf.add_edge(start, idx[0], n//4, 0) mcf.add_edge(start, end, n//4, 0) ans-=mcf.flow(S, T, n//4+f) print(ans)