Submission #377629

#	Time	Username	Problem	Language	Result	Execution time	Memory
377629		dimashii	Bajka (COCI20_bajka)	C++17	70 / 70	101 ms	2412 KiB

bajka

#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) {
			for (int k = 0; k < n; ++k) {
				if (s[i] == s[k])
					dp[i][j - 1] = min(dp[i][j - 1], dp[k][j - 1] + abs(i - k)); 
			}
		}
		for (int i = 0; i < n; ++i) {
			if (s[i] == t[j - 1]) {
				if (i > 0) dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1);
				if (i + 1 < n) dp[i][j] = min(dp[i][j], dp[i + 1][j - 1] + 1);
			}
		}
	}
	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 / 20
• Subtask 2: 50 / 50