結果

問題 No.1288 yuki collection
ユーザー hiragn
提出日時 2022-12-13 16:21:47
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 2,927 ms / 5,000 ms
コード長 2,728 bytes
コンパイル時間 248 ms
コンパイル使用メモリ 13,184 KB
実行使用メモリ 12,800 KB
最終ジャッジ日時 2024-11-07 11:18:22
合計ジャッジ時間 56,649 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from heapq import heappush, heappop
class MinCostFlow:
    INF = 10 ** 18
    def __init__(self, N):
        self.N = N
        self.G = [[] for _ 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 = [0] * 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 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 main():
    n = int(input())
    s = input()
    v = [0] + list(map(int, input().split()))
    d = {"y": 0, "u": 1, "k": 2, "i": 3}
    idx = [[] for _ in range(4)]
    for i, c in enumerate(s, 1):
        idx[d[c]].append(i)
    g = MinCostFlow(n + 2)
    infty = 10 ** 10
    # 始点から1個目のyへ
    if idx[0]:
        g.add_edge(0, idx[0][0], infty, 0)
    # すべてのiから終点へ
    for x in idx[-1]:
        g.add_edge(x, n + 1, 1, infty - v[x])
    # y-u, u-k, k-i間
    for i in range(3):
        for fr in idx[i]:
            to = next(filter(lambda t: t > fr, idx[i + 1]), None)
            if to:
                g.add_edge(fr, to, 1, infty - v[fr])
    # 同じ文字間
    for x in idx:
        for i in range(len(x) - 1):
            g.add_edge(x[i], x[i + 1], infty, 0)
    # 結果表示
    ans = 0
    while True:
        tmp = g.flow(0, n + 1, 1)
        if tmp is None:
            break
        tmp = 4 * infty - tmp
        if tmp < 0:
            break
        ans += tmp
    print(ans)
if __name__ == "__main__":
    main()
    
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0