oj.uz

Submission #938185

# Submission time Handle Problem Language Result Execution time Memory
938185 2024-03-05T01:47:42 Z weakweakweak Bajka (COCI20_bajka) C++17
0 / 70
 4 ms 1372 KB 
#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] = 0;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j < n; j++) {
            if (s[j] != t[i]) continue;
            for (int lst = 0; lst < n; lst++) dp[i][j] = min(dp[i][j], dp[i - 1][lst] + abs(j - lst));    
        }
    }

    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.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Incorrect 1 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

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