Submission #804714

#TimeUsernameProblemLanguageResultExecution timeMemory
804714tlnk07Bajka (COCI20_bajka)C++17
20 / 70
1079 ms300 KiB
#include<bits/stdc++.h> using namespace std; long long n, m, mini = INT_MAX; string s, str; long long backtrack(int pos, int x) { if(x == m) return 0; long long temp = INT_MAX; for(int i = 0; i < n; ++i) { if(s[i] == s[pos]) { if(i < n - 1 && s[i + 1] == str[x]) temp = min(temp, backtrack(i + 1, x + 1) + abs(pos - i) + 1); if(i > 0 && s[i - 1] == str[x]) temp = min(temp, backtrack(i - 1, x + 1) + abs(pos - i) + 1); } } return temp; } int main() { cin >> n >> m >> s >> str; for(int i = 0; i < n; ++i) if(s[i] == str[0]) mini = min(mini, backtrack(i, 1)); if(mini < INT_MAX) cout << mini; else cout << -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...