Submission #64559724

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/*
inf = 1 << 60
n = int(input())
c = list(map(int, input().split()))
x = list(map(int, input().split()))
C = c + c
ans=inf
for s in range(n):
    goal = C[s : s + n]
    dp = [[inf] * n for _ in range(n)]
    for i in range(n):
        dp[i][i] = 1 + x[goal[i] - 1]
    for i in range(2, n + 1):
        for l in range(0, n - i + 1):
            r = l + i - 1
            dp[l][r] = min(dp[l][r],dp[l][r - 1] + 1 + x[goal[r] - 1])
            for k in range(l, r):
                if goal[k] == goal[r]:
                    c = dp[l][k]+r-k
                    if k + 1 < r:
                        c += dp[k + 1][r - 1]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

/*
inf = 1 << 60
n = int(input())
c = list(map(int, input().split()))
x = list(map(int, input().split()))
C = c + c
ans=inf
for s in range(n):
    goal = C[s : s + n]
    dp = [[inf] * n for _ in range(n)]
    for i in range(n):
        dp[i][i] = 1 + x[goal[i] - 1]
    for i in range(2, n + 1):
        for l in range(0, n - i + 1):
            r = l + i - 1
            dp[l][r] = min(dp[l][r],dp[l][r - 1] + 1 + x[goal[r] - 1])
            for k in range(l, r):
                if goal[k] == goal[r]:
                    c = dp[l][k]+r-k
                    if k + 1 < r:
                        c += dp[k + 1][r - 1]
                    if c < dp[l][r]:
                        dp[l][r] = c
    ans=min(dp[0][-1],ans)
print(ans)
*/

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main() {
    const ll inf = 1LL << 60;
    int n;
    cin >> n;

    vector<int> c(n);
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }

    vector<int> x(n);
    for (int i = 0; i < n; ++i) {
        cin >> x[i];
    }

    vector<int> C(2 * n);
    for (int i = 0; i < n; ++i) {
        C[i] = c[i];
        C[i + n] = c[i];
    }

    ll ans = inf;

    for (int s = 0; s < n; ++s) {
        vector<int> goal(C.begin() + s, C.begin() + s + n);
        vector<vector<ll>> dp(n, vector<ll>(n, inf));

        for (int i = 0; i < n; ++i) {
            dp[i][i] = 1 + x[goal[i] - 1];
        }

        for (int len = 2; len <= n; ++len) {
            for (int l = 0; l <= n - len; ++l) {
                int r = l + len - 1;
                dp[l][r] = min(dp[l][r], dp[l][r - 1] + 1 + x[goal[r] - 1]);
                for (int k = l; k < r; ++k) {
                    if (goal[k] == goal[r]) {
                        ll cost = dp[l][k] + (r - k);
                        if (k + 1 < r) {
                            cost += dp[k + 1][r - 1];
                        }
                        dp[l][r] = min(dp[l][r], cost);
                    }
                }
            }
        }

        ans = min(ans, dp[0][n - 1]);
    }

    cout << ans << '\n';
    return 0;
}

Submission Info

Judge Result