# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1016095 | vjudge1 | Bajka (COCI20_bajka) | C++17 | 65 ms | 792 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e6;
int main()
{
int n,m;
cin>>n>>m;
string s,t;
cin>>s>>t;
int dp[n][m+1];
for (int i=0;i<n;i++)
for (int j=0;j<=m;j++)
dp[i][j]=inf*j;
vector<int> ind[256];
for (int i=0;i<n;i++)
ind[s[i]].push_back(i);
for (int j=1;j<=m;j++)
for (int i=0;i<n;i++)
{
for (int k:ind[s[i]])
{
if (k && s[k-1]==t[m-j])
dp[i][j]=min(dp[i][j],dp[k-1][j-1]+1+abs(i-k));
if (k<n-1 && s[k+1]==t[m-j])
dp[i][j]=min(dp[i][j],dp[k+1][j-1]+1+abs(i-k));
}
}
int ans=dp[0][m];
for (int i=1;i<n;i++)
ans=min(ans,dp[i][m]);
if (ans>=inf)
return cout<<-1<<endl, 0;
cout<<ans-1<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |