#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int dp[400][400];
int main()
{
owo
int n,m;
cin>>n>>m;
string a,b;
cin>>a>>b;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
dp[i][j] = 1e9;
}
}
for(int i=0;i<n;i++){
if(a[i] == b[0])dp[i][0] = 0;
}
for(int i=1;i<m;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
if(a[j] != b[i])continue;
if(k==j)dp[j][i] = min(dp[j][i],dp[k][i-1] + 2);
else dp[j][i] = min(dp[j][i],dp[k][i-1] + abs(j-k));
}
}
}
int ans =1e9;
for(int i=0;i<n;i++){
if(dp[i][m-1] != -1)ans = min(ans,dp[i][m-1]);
}
if(ans == 1e9)ans = -1;
cout<<ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
716 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
