Construct the String
Let's denote the function $$$f(s)$$$ that takes a string $$$s$$$ consisting of lowercase Latin letters and dots, and returns a string consisting of lowercase Latin letters as follows:  let $$$r$$$ be an empty string;  process the characters of $$$s$$$ from left to right. For each character $$$c$$$, do the following: if $$$c$$$ is a lowercase Latin letter, append $$$c$$$ at the end of the string $$$r$$$; otherwise, delete the last character from $$$r$$$ (if $$$r$$$ is empty before deleting the last character — the function crashes);  return $$$r$$$ as the result of the function. You are given two strings $$$s$$$ and $$$t$$$. You have to delete the minimum possible number of characters from $$$s$$$ so that $$$f(s) = t$$$ (and the function does not crash). Note that you aren't allowed to insert new characters into $$$s$$$ or reorder the existing ones.
The input consists of two lines: the first one contains $$$s$$$ — a string consisting of lowercase Latin letters and dots, the second one contains $$$t$$$ — a string consisting of lowercase Latin letters ($$$1 \le |t| \le |s| \le 10000$$$).Additional constraint on the input: it is possible to remove some number of characters from $$$s$$$ so that $$$f(s) = t$$$.
Print one integer — the minimum possible number of characters you have to delete from $$$s$$$ so $$$f(s)$$$ does not crash and returns $$$t$$$ as the result of the function.
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
s = list(input().rstrip())
t = list(input().rstrip())
s = [i - 46 for i in s] + [2]
t = [i - 46 for i in t] + [2]
(n, m) = (len(s), len(t))
c = [-1] * n
for i in range(n):
    if not s[i]:
        continue
    u = 0
    for j in range(i, n):
        u += min(s[j], 2) - 1
        if not u:
            c[j + 1] = i
            break
inf = pow(10, 9) + 1
dp = [inf] * (n + 1)
dp[0] = 0
for i in range(m):
    mi = inf
    for j in range(n):
        mi = min(mi + 1, dp[j])
        if c[j] ^ -1:
            mi = min(mi, dp[c[j]])
        dp[j] = mi
    ti = t[i]
    for j in range(n - 1, i - 1, -1):
        dp[j + 1] = inf if ti ^ s[j] else dp[j]
    dp[i] = inf
ans = dp[-1]
print(ans)
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
s = list(input().rstrip())
t = list(input().rstrip())
s = [i - 46 for i in s] + [2]
t = [i - 46 for i in t] + [2]
(n, m) = (len(s), len(t))
c = [-1] * n
for i in range(n):
    if not s[i]:
        continue
    u = 0
    for j in range(i, n):
        u += min(s[j], 2) - 1
        if not u:
            c[j + 1] = i
            break
inf = pow(10, 9) + 1
dp = [inf] * (n + 2)
dp[0] = 0
for i in range(m):
    for j in range(i + 1, n):
        dp[j] = min(dp[j - 1] + 1, dp[j], dp[c[j]])
    ti = t[i]
    for j in range(n - 1, i - 1, -1):
        dp[j + 1] = inf if ti ^ s[j] else dp[j]
    dp[i] = inf
ans = dp[-2]
print(ans)
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
s = list(input().rstrip())
t = list(input().rstrip())
s = [i - 46 for i in s] + [2]
t = [i - 46 for i in t] + [2]
(n, m) = (len(s), len(t))
c = [-1] * n
for i in range(n):
    if not s[i]:
        continue
    u = 0
    for j in range(i, n):
        u += min(s[j], 2) - 1
        if not u:
            c[j + 1] = i
            break
inf = pow(10, 9) + 1
dp = [inf] * (n + 2)
dp[0] = 0
for i in range(m):
    for j in range(i + 1, n):
        dp[j] = min(dp[j - 1] + 1, dp[j], dp[c[j]])
    ti = t[i]
    for j in range(n - 1, i - 1, -1):
        dp[j + 1] = inf if ti ^ s[j] else dp[j]
    dp[i] = inf
ans = dp[-2]
print(ans)