Submission #447836

#	Time	Username	Problem	Language	Result	Execution time	Memory
447836		Apiram	Bajka (COCI20_bajka)	C++14	0 / 70	18 ms	1936 KiB

bajka

#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,m; cin>>n>>m;
    string s,t; cin>>s>>t; 
    int64_t dp[m+2][n+2];

    for(int i = 0 ; i <= m ; i++) {
        for(int j = 0 ; j <= n+1 ; j++) {
            dp[i][j] = INT_MAX;
        }
    }

    for(int i = 0 ; i <= n+1 ; i++) dp[0][i]=0;

    for(int i = 0 ; i < m ; i++) {
        for(int j = 1 ; j <= n ; j++) {
        	  if(s[j-1] != t[i]) continue;
        	dp[i+1][j]=min(dp[i+1][j],min(dp[i][j-1],dp[i][j+1])+1);
          
            for(int k = 1 ; k <= n ; k++) {
                if(s[k-1] == t[i]) {
                    dp[i+1][k] = min(dp[i+1][k],dp[i+1][j] + abs(j-k));
                }
            }
        }
    }
    for (int i = 0;i<=n;++i){
    	for (int j = 0;j<=m;++j){
    		cout<<dp[i][j]<<" ";
    	}
    	cout<<endl;
    }
    int64_t mn = INT_MAX;
    for(int i = 0 ; i <= n ; i++) {
        mn=min(mn,dp[m][i]);
    }
    if (mn==INT_MAX){
    	cout<<-1<<endl;
    }
    else
    cout << mn-1;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 50