oj.uz

Submission #545361

# Submission time Handle Problem Language Result Execution time Memory
545361 2022-04-04T10:52:08 Z leaked Copy and Paste 3 (JOI22_copypaste3) C++14
1 / 100
 44 ms 53664 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define vec vector
#define pb push_back
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_resp ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef pair<int,ll> pil;
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
const ll inf=1e18;
const int N=1e3+3;
ll dp[2][N][N];
///l,r,prefix
//int pref[N][N];
vec<int> zet[N];
vec<int> z_func(string s){
    int l=0,r=-1;
    vec<int> zt(sz(s),0);
    for(int i=1;i<sz(s);i++){
        zt[i]=(i>r?0:min(r-i+1,zt[i-l]));
        while(i+zt[i]<sz(s) && s[i+zt[i]]==s[zt[i]]) ++zt[i];
        if(i+zt[i]-1>r){
            r=i+zt[i]-1;
            l=i;
        }
    }
    return zt;
}
signed main(){
    fast_resp;
    int n;
    string s;
    cin>>n>>s;
    int a,b,c;
    cin>>a>>b>>c;
    for(int t=0;t<2;t++){
        for(int j=0;j<N;j++){
            for(int k=0;k<N;k++)
                dp[t][j][k]=inf;
        }
    }
    for(int i=0;i<n;i++){
        zet[i]=z_func(s.substr(i,n-i)+'#'+s.substr(i,n-i));
//        for(int j=i;j<n;j++){
//            cout<<s.substr(i,n-i)<<' '<<s.substr(j,n-j)<<' '<<zet[i][j-i+n-i+1]<<'\n';
//        }
//        for(int j=i+1;j<n;j++){
//            int jt=pref[i][j-1];
//            while(jt && s[j]!=s[jt+i]) jt=pref[i][jt-1];
//            pref[i][j]=jt+(s[jt+i]==s[j]);
//        }
    }
    for(int l=n-1;l>=0;l--){
        int nl=(l%2)^1;
        for(int r=max(l-1,0);r<n;r++){
            for(int k=0;k<=r-l+2;k++)
                dp[nl][r][k]=inf;
        }
        int lt=l%2;
        for(int r=l;r<n;r++){
            if(l==r) dp[lt][r][0]=a;
            for(int k=0;k<=r-l+1;k++){
//                cout<<"
                if(r-k+1>=l+k && zet[l][r-k+2+n-l]>=k){
                    umin(dp[lt][r][k],dp[lt][r-k][k]+c);
                }
                umin(dp[lt][r][r-l+1],dp[lt][r][k]+b+c);
                if(l)
                    umin(dp[nl][r][0],dp[lt][r][k]+a);
                if(r+1<n)
                    umin(dp[lt][r+1][k],dp[lt][r][k]+a);
                umin(dp[lt][r][0],dp[lt][r][k]);
            }
        }
    }
//    cout<<dp[2][4][3]<<endl;
    ll ans=inf;
    for(int i=0;i<=n;i++)
        umin(ans,dp[0][n-1][i]);
    cout<<ans;
    return 0;
}
/*

*/

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 8 ms 16068 KB Output is correct
3 Correct 7 ms 16084 KB Output is correct
4 Correct 7 ms 16084 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 7 ms 16076 KB Output is correct
7 Correct 7 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 15960 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 6 ms 16084 KB Output is correct
3 Runtime error 44 ms 53664 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 8 ms 16068 KB Output is correct
3 Correct 7 ms 16084 KB Output is correct
4 Correct 7 ms 16084 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 7 ms 16076 KB Output is correct
7 Correct 7 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 15960 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Incorrect 7 ms 16084 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 8 ms 16068 KB Output is correct
3 Correct 7 ms 16084 KB Output is correct
4 Correct 7 ms 16084 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 7 ms 16076 KB Output is correct
7 Correct 7 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 15960 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Incorrect 7 ms 16084 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 8 ms 16068 KB Output is correct
3 Correct 7 ms 16084 KB Output is correct
4 Correct 7 ms 16084 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 7 ms 16076 KB Output is correct
7 Correct 7 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 15960 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Incorrect 7 ms 16084 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 8 ms 16068 KB Output is correct
3 Correct 7 ms 16084 KB Output is correct
4 Correct 7 ms 16084 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 7 ms 16076 KB Output is correct
7 Correct 7 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 15960 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 6 ms 16084 KB Output is correct
13 Runtime error 44 ms 53664 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -