Submission #938187

#	Time	Username	Problem	Language	Result	Execution time	Memory
938187		weakweakweak	Bajka (COCI20_bajka)	C++17	50 / 70	2 ms	1372 KiB

bajka

#include <bits/stdc++.h>
using namespace std;

int n, m, dp[510][510] = {0};
string s, t;

int main () {
    memset(dp, 63, sizeof(dp));
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m >> s >> t;
    t = "%" + t;

    for (int i = 0; i < n; i++) dp[0][i] = -1;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j < n; j++) {
            if (s[j] != t[i]) continue;
            if (j > 0) dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1);
            if (j + 1 < n) dp[i][j] = min(dp[i][j], dp[i - 1][j + 1] + 1);
        }
        int mn = INT_MAX / 2;
        for (int j = 0; j < n; j++) {
            if (s[j] == t[i]) {
                dp[i][j] = min(dp[i][j], mn + j);
                mn = min(mn, dp[i][j] - j);
            }
        }
        mn = INT_MAX / 2;
        for (int j = n - 1; j >= 0; j--) {
            if (s[j] == t[i]) {
                dp[i][j] = min(dp[i][j], mn - j);
                mn = min(mn, dp[i][j] + j);
            }
        }
    }

    int ans = INT_MAX;
    for (int i = 0; i < n; i++) ans = min(ans, dp[m][i]);
    if (ans > 100000) ans = -1;
    cout << ans << '\n';
}

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