結果
問題 | No.1288 yuki collection |
ユーザー | persimmon-persimmon |
提出日時 | 2021-02-17 09:31:42 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,127 bytes |
コンパイル時間 | 528 ms |
コンパイル使用メモリ | 87,080 KB |
実行使用メモリ | 91,760 KB |
最終ジャッジ日時 | 2023-10-11 21:07:59 |
合計ジャッジ時間 | 28,165 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
75,580 KB |
testcase_01 | AC | 87 ms
70,972 KB |
testcase_02 | AC | 82 ms
71,104 KB |
testcase_03 | AC | 119 ms
77,296 KB |
testcase_04 | AC | 79 ms
71,248 KB |
testcase_05 | AC | 79 ms
71,104 KB |
testcase_06 | AC | 92 ms
75,896 KB |
testcase_07 | AC | 82 ms
71,152 KB |
testcase_08 | AC | 146 ms
77,348 KB |
testcase_09 | AC | 122 ms
77,252 KB |
testcase_10 | AC | 140 ms
76,912 KB |
testcase_11 | AC | 112 ms
76,960 KB |
testcase_12 | AC | 134 ms
77,232 KB |
testcase_13 | AC | 1,083 ms
89,936 KB |
testcase_14 | AC | 1,079 ms
89,248 KB |
testcase_15 | AC | 910 ms
86,820 KB |
testcase_16 | AC | 923 ms
86,912 KB |
testcase_17 | AC | 1,149 ms
90,364 KB |
testcase_18 | WA | - |
testcase_19 | AC | 1,080 ms
89,912 KB |
testcase_20 | AC | 1,029 ms
85,844 KB |
testcase_21 | AC | 999 ms
88,024 KB |
testcase_22 | AC | 1,153 ms
91,760 KB |
testcase_23 | AC | 1,146 ms
91,192 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 644 ms
84,604 KB |
testcase_28 | AC | 719 ms
86,072 KB |
testcase_29 | WA | - |
testcase_30 | AC | 246 ms
81,036 KB |
testcase_31 | AC | 261 ms
81,336 KB |
testcase_32 | AC | 266 ms
81,004 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**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)