제출 #883160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883160		LucaIlie	Copy and Paste 3 (JOI22_copypaste3)	C++17	0 / 100	1 ms	2648 KiB

copypaste3

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2500;
long long dp[MAX_N][MAX_N];

int main() {
    int n, a, b, c;
    string s;

    cin >> n >> s >> a >> b >> c;

    for ( int i = 0; i < n; i++ )
        dp[i][i] = a;

    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 + 1][r], dp[l][r - 1] ) + a;
            for ( int d = 1; d * d <= len; d++ ) {
                if ( len % d == 0 ) {
                    bool ok;

                    ok = true;
                    for ( int i = l; i <= r - d; i++ )
                        ok &= (s[i] == s[i + d]);
                    if ( ok )
                        dp[l][r] = min( dp[l][r], dp[l][l + d - 1] + b + (len / d) * c );

                    d = len / d;
                    ok = true;
                    for ( int i = l; i <= r - d; i++ )
                        ok &= (s[i] == s[i + d]);
                    if ( ok )
                        dp[l][r] = min( dp[l][r], dp[l][l + d - 1] + b + (len / d) * c );

                    d = len / d;
                }
            }

            //printf( "%d %d %lld\n", l, r, dp[l][r] );
        }
    }

    cout << dp[0][n - 1];

    return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 5
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 32
• Subtask 6: 0 / 38