Submission #693165

#TimeUsernameProblemLanguageResultExecution timeMemory
693165dozerBajka (COCI20_bajka)C++14
70 / 70
54 ms4308 KiB
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int ,int>
#define st first
#define nd second
#define sp " "
#define endl "\n"
#define N 1005
#define M 30

const int INF = 1e9 + 7;
string s, t;
vector<int> ind[M];
int dp[N][N];

int f(int i, int j)
{
	if (j == t.size()) return 0;
	if (dp[i][j] != -1) return dp[i][j];
	int ans = INF;
	for (auto k : ind[s[i] - 'a'])
	{
		if (k > 0 && s[k - 1] == t[j]) ans = min(ans, f(k - 1, j + 1) + 1 + abs(i - k));
		if (k < (int)s.size() - 1 && s[k + 1] == t[j]) ans = min(ans, f(k + 1, j + 1) + 1 + abs(i - k));
	}
	return dp[i][j] = ans;
}


int32_t main()
{
	fastio();


	memset(dp, -1, sizeof(dp));
	int n, m;
	cin>>n>>m;
	cin>>s>>t;
	int ans = INF;
	for (int i = 0; i < n; i++)
	{
		ind[s[i] - 'a'].pb(i);
	}
	for (int i = 0; i < n; i++)
	{
		if (s[i] == t[0]) ans = min(ans, f(i, 1));
	}

	if (ans >= INF) cout<<-1<<endl;
	else cout<<ans<<endl;
	
	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Compilation message (stderr)

bajka.cpp: In function 'int f(int, int)':
bajka.cpp:21:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  if (j == t.size()) return 0;
      |      ~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...