oj.uz

답안 #545354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545354 2022-04-04T10:40:26 Z leaked Copy and Paste 3 (JOI22_copypaste3) C++14
0 / 100
 0 ms 340 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
signed main(){
    fast_resp;
    int n;
    string s;
    cin>>n>>s;
    int a,b,c;
    cin>>a>>b>>c;
    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++){
                if(r-k+1>=l+k && s.substr(l,k)==s.substr(r-k+1,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
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -