제출 #547042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547042		ngrace	Copy and Paste 3 (JOI22_copypaste3)	C++14	100 / 100	1048 ms	758384 KiB

copypaste3

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <string>
using namespace std;
#define v vector
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
 
int main(){
    int N;
    cin>>N;
    string S;
    cin>>S;
    ll A,B,C;
    cin>>A>>B>>C;
    
    v<int> def(26, -1);
    v<v<int>> sub(1, v<int>(26, -1));
    int pairToInd[N][N+1];
    v<int> indToStarts[N*N+10];
    int subInd=1;
    for(int l=0; l<N; l++){
        int ind=0, child;
        for(int r=l; r<N; r++){
            child = S[r]-'a';
            if(sub[ind][child]==-1){
                sub.push_back(def);
                sub[ind][child] = subInd++;
            }
            ind=sub[ind][child];
            pairToInd[l][r-l+1] = ind;
            indToStarts[ind].push_back(l);
        }
    }
 
    v<v<int>> nextOccur(N,v<int>(N+1,N));
    for(int i=N-1; i>=0; i--){
        for(int s=1; s<=N-i; s++){
            int ind=pairToInd[i][s];
            v<int>::iterator next = lower_bound(indToStarts[ind].begin(), indToStarts[ind].end(), i+s);
            if(next!=indToStarts[ind].end()) nextOccur[i][s]=(*next);
        }
    }
 
    
    v<v<ll>> dp(N, v<ll>(N,1e17));
    for(int s=1; s<=N; s++){
        for(int l=N-1; l>=0; l--){
            dp[l][l]=A;
            if(s!=1 && l+s-1<N){
                dp[l][l+s-1] = min(dp[l][l+s-1], A+dp[l+1][l+s-1]);
                dp[l][l+s-1] = min(dp[l][l+s-1], dp[l][l+s-1-1]+A);
            }
            int num=2, nex=nextOccur[l][s];
            while(nex<N){
                int r=nex+s-1;
                dp[l][r] = min(dp[l][r], dp[l][l+s-1]+B+C*num+(r-l+1 - num*s)*A);
                dp[l][r] = min(dp[l][r], A+dp[l+1][r]);
                dp[l][r] = min(dp[l][r], dp[l][r-1]+A);
                nex=nextOccur[nex][s];
                num++;
            }
        }
    }
 
    cout<<dp[0][N-1]<<endl;
}

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