oj.uz

Submission #804762

# Submission time Handle Problem Language Result Execution time Memory
804762 2023-08-03T11:11:03 Z tlnk07 Bajka (COCI20_bajka) C++17
20 / 70
 1000 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;

long long n, m, mini = INT_MAX;
string s, str;
vector<int> vec[30];

long long backtrack(int pos, int 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);
	}
	return temp;
}

int main()
{
	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;
}

Subtask #1
20.0 / 20.0

# 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -