提出 #64552897

---

ソースコード 拡げる

#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;

    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        a[i]--;
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }

    std::vector f(2 * n + 1, std::vector<i64> (2 * n + 1, 1E18)), g(f);
    for (int i = 0; i <= 2 * n; i++) {
        f[i][i] = 0;
        g[i][i] = b[a[i % n]];
    }

    for (int t = 1; t <= n; t++) {
        for (int i = 0; i + t <= 2 * n; i++) {
            int j = i + t;
            for (int k = i + 1; k < j; k++) {
                f[i][j] = std::min(f[i][j], f[i][k] + f[k][j]);
            }
            for (int k = i; k < j; k++) {
                g[i][j] = std::min(g[i][j], g[i][k] + f[k][j] + j - k);
            }
            if (a[i % n] == a[(j - 1) % n]) {
                g[i][j] = std::min(g[i][j], g[i][j - 1] + 1);
            }
            f[i][j] = std::min(f[i][j], g[i][j]);
        }
    }

    i64 ans = 1E18;
    for (int i = 0; i <= n; i++) {
        ans = std::min(ans, f[i][i + n]);
    }

    std::cout << ans << "\n";

    return 0;
}

提出情報

ジャッジ結果