Submission #74709119

---

Source Code Expand

import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lii = lambda: list(mii())
inf = 1 << 64
from bisect import bisect_left,bisect_right
def solve():
    s1 = list(input())
    s2 = list(input())
    n,m = len(s1),len(s2)
    tatol = n*(n+1)//2
    cnt = [[] for i in range(26)]
    for i,x in enumerate(s1):
        cnt[ord(x)-97].append(i)
    for i in range(n):
        pre = i
        ok = True
        for j,x in enumerate(s2):
            x = ord(x)-97
            idx = bisect_left(cnt[x],pre)
            if idx>=len(cnt[x]):
                ok = False
                break
            pre = cnt[x][idx]+1
        if ok:
            tatol-=(n-pre+1)
    print(tatol)

t = 1
# t = ii()
for _ in range(t):
    solve()

Submission Info

Judge Result