oj.uz

Submission #377624

# Submission time Handle Problem Language Result Execution time Memory
377624 2021-03-14T13:26:11 Z dimashii Bajka (COCI20_bajka) C++17
20 / 70
 9 ms 2284 KB 
#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int mxN = 1e3 + 5, mod = 1e9 + 7;

const ll inf = 1e18;

int n, m;

ll dp[mxN][mxN];

string s, t;

int main() {
	ios :: sync_with_stdio(false), cin.tie(nullptr);
	cin >> n >> m >> s >> t;
	for (int i = 0; i < n; ++i) {
		for (int j = 1; j <= m; ++j)
			dp[i][j] = inf;
	}
	for (int i = 0; i < n; ++i) {
		if (s[i] == t[0])
			dp[i][1] = 0;
	}
	for (int j = 2; j <= m; ++j) {
		for (int i = 0; i < n; ++i) {
			if (s[i] == t[j - 1]) {
				for (int k = i - 1; k >= 0; k--) {
					if (s[k] == t[j - 2]) 
						dp[i][j] = min(dp[i][j], dp[k][j - 1] + (i - k));
				}
				for (int k = i + 1; k < n; ++k) {
					if (s[k] == t[j - 2]) 
						dp[i][j] = min(dp[i][j], dp[k][j - 1] + (k - i));
				}
			}
		}
	}
	ll ans = inf;
	for (int i = 0; i < n; ++i)
		ans = min(ans, dp[i][m]);
	if (ans == inf)
		ans = -1;
	cout << ans;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct

Subtask #2
0 / 50.0

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