# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447799 | Apiram | Bajka (COCI20_bajka) | C++14 | 24 ms | 1452 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;
vector<vector<int>>dp(500,vector<int>(500,-1));
vector<vector<int>>freq(26);
int64_t solve(int i,int cur,string t){
if (i==t.length())return 0;
if (dp[i][cur]!=-1){
return dp[i][cur];
}
int64_t counts=INT_MAX;
for (auto x:freq[t[i]-'a']){
if (x!=cur)
counts=min(counts,solve(i+1,x,t)+(int64_t)abs(cur-x));
}
return dp[i][cur]=counts;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;cin>>n>>m;
string s;
cin>>s;
string t;cin>>t;
for (int i = 0 ;i<n;++i){
freq[s[i]-'a'].push_back(i);
}
int64_t counts=INT_MAX;
for (auto x:freq[t[0]-'a']){
counts=min(counts,solve(1,x,t));
}
if (counts==INT_MAX)cout<<-1<<endl;
else
cout<<counts<<endl;
return 0;}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |