제출 #1060912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060912		12345678	Copy and Paste 3 (JOI22_copypaste3)	C++17	15 / 100	275 ms	4444 KiB

copypaste3

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=505, mod=1e9+7, mul=31;

ll n, a, b, c, s[nx], dp[nx][nx];
string stmp;

bool match(int l1, int r1, int l2, int r2)
{
    for (int i=0; i<=r1-l1; i++) if (s[l1+i]!=s[l2+i]) return 0;
    return 1;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>stmp>>a>>b>>c;
    for (int i=1; i<=n; i++) s[i]=stmp[i-1]-'a'+1;
    for (int i=1; i<=n; i++) dp[i][i]=a;
    for (int sz=1; sz<=n; sz++)
    {
        for (int l=1; l+sz<=n; l++)
        {
            int r=l+sz;
            dp[l][r]=min(dp[l+1][r], dp[l][r-1])+a;
            for (int md=l; md<=r; md++)
            {
                ll idx=md+1, cnt=1, blk=0;
                while (idx<=r)
                {
                    if (match(l, md, idx, idx+md-l)) cnt++, idx=idx+md-l+1;
                    else idx++, blk++;
                }
                dp[l][r]=min(dp[l][r], dp[l][md]+blk*a+c*cnt+b);
            }
        }
    }
    cout<<dp[1][n];
}

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