oj.uz

Submission #448165

# Submission time Handle Problem Language Result Execution time Memory
448165 2021-07-29T04:58:39 Z flappybird Bajka (COCI20_bajka) C++14
20 / 70
 7 ms 2124 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define MAX 1010
#define MOD 1000000007
#define ln '\n'
ll arr[MAX][MAX];
signed main() {
	ll N, M;
	cin >> N >> M;
	string s1, s2;
	cin >> s1 >> s2;
	ll i, j;
	for (i = 0; i < N; i++) {
		if (s1[i] != s2[0]) arr[0][i] = 1010101010;
	}
	for (i = 1; i < M; i++) {
		vector<ll> pr;
		for (j = 0; j < N; j++) {
			if (s1[j] == s2[i - 1]) pr.push_back(j);
		}
		ll chk = 0;
		for (j = 0; j < N; j++) {
			arr[i][j] = 101010101010;
			if (s1[j] == s2[i]) {
				for (auto k : pr) {
					if (k == j) continue;
					chk = 1;
					arr[i][j] = min(arr[i][j], abs(k - j) + arr[i - 1][k]);
				}
			}
		}
		if (!chk) {
			cout << -1 << ln;
			return 0;
		}
	}
	ll ans = 1010101010;
	for (i = 0; i < N; i++) {
		if (s1[i] == s2[M - 1]) ans = min(ans, arr[M - 1][i]);
	}
	cout << ans << ln;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 0 ms 332 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2124 KB Output isn't correct
2 Halted 0 ms 0 KB -