Submission #1014322

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014322		Aiperiii	Copy and Paste 3 (JOI22_copypaste3)	C++14	6 / 100	1190 ms	68952 KiB

copypaste3

#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=2505,mod=(1<<61)-1;
int h[N][N],dp[N][N];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,a,b,c;
    cin>>n;
    string s;
    cin>>s;
    cin>>a>>b>>c;
    for(int i=0;i<n;i++){
        h[i][i]=s[i]-'a';
        //cout<<h[i][i]<<" ";
        for(int j=i+1;j<n;j++){
            h[i][j]=h[i][j-1]*26+(s[j]-'a');
            h[i][j]%=mod;
            dp[i][j]=1e18;
            //cout<<h[i][j]<<" ";
        }
        dp[i][i]=a;
        //cout<<"\n";
    }
    
    for(int sz=1;sz<=n;sz++){
        vector <pair <int,int> > v;
        for(int l=0;l<=n-sz;l++){
            int r=l+sz-1;
            dp[l][r]=min(dp[l][r],min(dp[l+1][r],dp[l][r-1])+a);
            v.pb({h[l][r],l});
        }
        sort(all(v));
        for(auto x : v){
            int pos=x.ss;
            int hash=x.ff;
            int cnt=1;
            while(true){
                pair <int,int> p={hash,pos+sz};
                auto it=lower_bound(all(v),p);
                if(it!=v.end() && it->ff==hash){
                    pos=it->ss;
                    cnt++;
                    dp[x.ss][pos+sz-1]=min(dp[x.ss][pos+sz-1],dp[x.ss][x.ss+sz-1]+b+c*cnt+a*(pos+sz-x.ss-sz*cnt));
                }
                else break;
            }
        }
        
    }
    cout<<dp[0][n-1]<<"\n";
}

/*
 2 5 4 9 15 11
 6 7 6 8 12 14
 1 0 0 0
 1 0 0 0
 0 0 0 0
 0 1 0 0
 0 1 1 0
 0 0 0 0

 0 1 0 0
 0 1 1 0
 0 1 0 0
 0 0 1 0
 0 0 1 1
 0 0 0 1
*/

Compilation message (stderr)

copypaste3.cpp:8:24: warning: left shift count >= width of type [-Wshift-count-overflow]
    8 | const int N=2505,mod=(1<<61)-1;
      |                       ~^~~~

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