# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011865 | Dedibeat | Bajka (COCI20_bajka) | C++14 | 3 ms | 1116 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;
#define int long long
signed main(){
int n, m;
cin >> n >> m;
string a, b;
cin >> a >> b;
int dp[n+5][m+5];
map<char, vector<int> > mp;
for(int i = 0; i<n; i++) mp[a[i]].push_back(i);
for(int i = 0; i<=m; i++){
for(int j = 0; j<n; j++) dp[i][j] = 1e18;
}
for(int j = 0; j<n; j++) {
if(a[j] == b[0]) dp[0][j] = 0;
}
for(int i = 1; i<m; i++){
for(int j = 0; j<n; j++){
if(a[j] == b[i]) {
// cout << j << endl;
if(j > 0) {
char x = a[j-1];
auto v = mp[x];
for(auto k : v){
int cost = abs((j - 1) - k);
dp[i][j] = min(dp[i-1][k] + cost, dp[i][j]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |