oj.uz

Submission #705779

# Submission time Handle Problem Language Result Execution time Memory
705779 2023-03-05T08:47:12 Z Abito Bajka (COCI20_bajka) C++17
50 / 70
 48 ms 1268 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
typedef unsigned long long ull;
using namespace std;
const int N=305;
int dp[N][N],n,m;
char a[N],b[N];
bool vis[N][N];
vector<int> adj[30];
int rec(int i,int j){
    //cout<<i<<' '<<j<<endl;
    if (j==m) return 0;
    if (vis[i][j]) return dp[i][j];
    vis[i][j]=true;
    dp[i][j]=INT_MAX;
    if (i>1){
        if (a[i-1]==b[j+1]) dp[i][j]=min(dp[i][j],rec(i-1,j+1)+1);
    }
    if (i<n){
        if (a[i+1]==b[j+1]) dp[i][j]=min(dp[i][j],rec(i+1,j+1)+1);
    }
    for (auto u:adj[a[i]-'a']) dp[i][j]=min(dp[i][j],rec(u,j)+abs(u-i));
    return dp[i][j];
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        adj[a[i]-'a'].pb(i);
    }
    for (int j=1;j<=m;j++) cin>>b[j];
    int ans=INT_MAX;
    for (int i=1;i<=n;i++) ans=min(ans,rec(i,0));
    if (ans>=INT_MAX) cout<<-1<<endl;
    else cout<<ans-1<<endl;
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 5 ms 1268 KB Output is correct
3 Correct 2 ms 1244 KB Output is correct
4 Correct 2 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 24 ms 1108 KB Output is correct
9 Correct 48 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 5 ms 1108 KB Output is correct