| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 804775 |
2023-08-03T11:14:38 Z |
tlnk07 |
Bajka (COCI20_bajka) |
C++17 |
|
26 ms |
980 KB |
#include<bits/stdc++.h>
using namespace std;
long long n, m, mini = INT_MAX, val[301][301];
string s, str;
vector<int> vec[30];
long long backtrack(int pos, int x)
{
if(val[pos][x]) return val[pos][x];
if(x == m) return 0;
long long temp = INT_MAX;
for(int i : vec[s[pos] - 'a'])
{
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);
}
val[pos][x] = temp;
return temp;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> m >> s >> str;
for(int i = 0; i < n; ++i) vec[s[i] - 'a'].push_back(i);
for(int c : vec[str[0] - 'a']) mini = min(mini, backtrack(c, 1));
if(mini < INT_MAX) cout << mini;
else cout << -1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
968 KB |
Output is correct |
| 2 |
Correct |
1 ms |
980 KB |
Output is correct |
| 3 |
Correct |
1 ms |
980 KB |
Output is correct |
| 4 |
Correct |
1 ms |
980 KB |
Output is correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
3 ms |
980 KB |
Output is correct |
| 8 |
Correct |
17 ms |
980 KB |
Output is correct |
| 9 |
Correct |
26 ms |
980 KB |
Output is correct |
| 10 |
Correct |
0 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
980 KB |
Output is correct |
