제출 #464379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464379		dannyboy20031204	Bajka (COCI20_bajka)	C++17	70 / 70	1 ms	588 KiB

bajka

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define double long double
using namespace std;
void db() {cerr << endl;}
template <typename T, typename ...U> void db(T a, U ...b) {
    cerr << a << ' ', db(b...);
}
const int N = 100, inf = 1e9 + 1;
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    string s, t;
    cin >> s >> t;
    int dp[m][n], ans = inf;
    for (int i = 0; i < n; i++)
        if (s[i] == t[0])
            dp[0][i] = 0;
        else
            dp[0][i] = inf;
    for (int i = 1; i < m; i++){
        for (int j = 0; j < n; j++){
            dp[i][j] = inf;
            if (s[j] != t[i])
                continue;
            if (j) 
                dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1);
            if (j < n - 1)
                dp[i][j] = min(dp[i][j], dp[i - 1][j + 1] + 1);
        }
        int mi = inf;
        for (int j = 0; j < n; j++){
            if (s[j] != t[i])
                continue;
            dp[i][j] = min(dp[i][j], j + mi);
            mi = min(mi, dp[i][j] - j);
        }
        mi = inf;
        for (int j = n - 1; j >= 0; j--){
            if (s[j] != t[i])
                continue;
            dp[i][j] = min(dp[i][j], -j + mi);
            mi = min(mi, dp[i][j] + j);
            //db(i, j, dp[i][j]);
        }
    }
    for (int &i : dp[m - 1])
        ans = min(ans, i);
    cout << (ans < inf / 2 ? ans : -1);
}

• Subtask 1: 20 / 20
• Subtask 2: 50 / 50