結果
問題 | No.1288 yuki collection |
ユーザー | persimmon-persimmon |
提出日時 | 2021-02-17 09:54:03 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,886 bytes |
コンパイル時間 | 403 ms |
コンパイル使用メモリ | 86,980 KB |
実行使用メモリ | 150,588 KB |
最終ジャッジ日時 | 2023-10-11 21:26:50 |
合計ジャッジ時間 | 26,663 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
150,588 KB |
testcase_01 | AC | 77 ms
71,464 KB |
testcase_02 | AC | 77 ms
71,232 KB |
testcase_03 | AC | 123 ms
77,736 KB |
testcase_04 | AC | 78 ms
71,504 KB |
testcase_05 | AC | 78 ms
71,464 KB |
testcase_06 | AC | 87 ms
76,368 KB |
testcase_07 | AC | 79 ms
71,312 KB |
testcase_08 | AC | 130 ms
77,532 KB |
testcase_09 | AC | 112 ms
77,356 KB |
testcase_10 | AC | 140 ms
77,760 KB |
testcase_11 | AC | 103 ms
76,380 KB |
testcase_12 | AC | 128 ms
77,508 KB |
testcase_13 | AC | 1,076 ms
90,216 KB |
testcase_14 | AC | 1,064 ms
89,524 KB |
testcase_15 | AC | 892 ms
88,116 KB |
testcase_16 | AC | 886 ms
87,000 KB |
testcase_17 | AC | 1,068 ms
89,428 KB |
testcase_18 | WA | - |
testcase_19 | AC | 1,059 ms
89,300 KB |
testcase_20 | AC | 1,007 ms
86,972 KB |
testcase_21 | AC | 1,026 ms
87,572 KB |
testcase_22 | AC | 1,138 ms
91,868 KB |
testcase_23 | AC | 1,099 ms
91,612 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 617 ms
85,420 KB |
testcase_28 | AC | 712 ms
85,624 KB |
testcase_29 | WA | - |
testcase_30 | AC | 213 ms
81,200 KB |
testcase_31 | AC | 226 ms
80,652 KB |
testcase_32 | AC | 241 ms
80,640 KB |
testcase_33 | TLE | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
ソースコード
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**9 # n->n+1 ary=[-1]*5 ary[4]=n+1 d={'y':0,'u':1,'k':2,'i':3} for i in range(n-1,-1,-1): k=d[s[i]] if ary[k]!=-1: mcf.add_edge(i,ary[k],n//4,0) if ary[k+1]!=-1: mcf.add_edge(i,ary[k+1],1,-v[i]) ary[k]=i if ary[0]==-1: print(0) exit() mcf.add_edge(n,ary[0],n//4,0) return -mcf.flow(n,n+1,n//4) if __name__=='__main__': n=int(input()) s=list(input()) v=list(map(int,input().split())) ret1=main1(n,s,v) print(ret1)