Problem:
 Score : 500 points    Problem Statement Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.   Let s' be the concatenation of 10^{100} copies of s . t is a subsequence of the string {s'}_1{s'}_2\ldots{s'}_i (the first i characters in s' ).       Notes  A subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net , c , and contest .       Constraints  1 \leq |s| \leq 10^5  1 \leq |t| \leq 10^5  s and t consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  s  t       Output If there exists an integer i satisfying the following condition, print the minimum such i ; otherwise, print -1 .        Sample Input 1 contest
son      Sample Output 1 10  t =  son is a subsequence of the string contestcon (the first 10 characters in s' =  contestcontestcontest... ), so i = 10 satisfies the condition.  On the other hand, t is not a subsequence of the string contestco (the first 9 characters in s' ), so i = 9 does not satisfy the condition.  Similarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10 .       Sample Input 2 contest
programming      Sample Output 2 -1  t =  programming is not a substring of s' =  contestcontestcontest... . Thus, there is no integer i satisfying the condition.       Sample Input 3 contest
sentence      Sample Output 3 33  Note that the answer may not fit into a 32 -bit integer type, though we cannot put such a case here.

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    S = r()
    T = r()
    lenS = len(S)
    lenT = len(T)
    setT = set(T)
    
    dic = [[] for _ in range(28)]
    if setT - set(S):
        print(-1)
        return
    
    l = [0] * lenT
    for i, s in enumerate(S):
        dic[ord(s)-96].append(i)
        
        
    for i, t in enumerate(T):
        
        l[i] = ord(t) - 96
    
    tmp = dic[l[0]][0]
    cnt = 0
    for i in range(1, lenT):
        ll = dic[l[i]]
        j = bisect_right(ll, tmp)
        if j == len(ll):
            cnt += 1
            tmp = ll[0]
        else:
            tmp = ll[j]
            
    print(cnt*lenS+tmp+1)
    

    
    
    

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):

import bisect

def search_next_char(idxs, now, iter):
    l = len(idxs)
    next = bisect.bisect(idxs, now)
    if next >= l:
        iter += 1
        next = bisect.bisect(idxs, 0)
    return idxs[next], iter


s = input()
t = input()

set_s = set(s)
set_t = set(t)

if len(set_t - set_s) > 0:
    print(-1)
    exit()


c_idx = {}
for i, c in enumerate(s):
    if c in c_idx:
        c_idx[c].append(i+1)
    else:
        c_idx[c] = [i+1]

now = 0
iter = 0
for c in t:
    now, iter = search_next_char(c_idx[c], now, iter)

print(iter * len(s) + now)

Solution (Python):
from bisect import bisect_right
s = input()
t = input()
sc = [ [] for _ in range(26)]

n = len(s)
for i in range(n):
    p = ord(s[i]) - ord('a')
    sc[p].append(i+1)

for c in t:
    p = ord(c) - ord('a')
    if len(sc[p]) == 0:
        print(-1)
        exit()

ans = 0
x = 0
for c in t:
    p = ord(c) - ord('a')
    if len(sc[p]) == 0:
        print(-1)
        exit()
    tmp = bisect_right(sc[p], x)
    if tmp == len(sc[p]):
        px = x
        x = sc[p][0]
        ans += n - px + x
    else:
        px = x
        x = sc[p][tmp]
        ans += x - px
print(ans)

Solution (Python):
import bisect
from collections import defaultdict

S=input()
T=input()

def solve():
    obj=defaultdict(list)
    for i,s in enumerate(S):
        obj[s].append(i)

    result=1
    mx=-1
    for t in T:
        flag=True

        if not obj[t]:
            return -1

        
        bi_pos=bisect.bisect_right(obj[t],mx)
        if bi_pos==len(obj[t]):
            pos=-1
            mx=obj[t][0]
            result+=1
        else:
            pos=obj[t][bi_pos]
            mx=pos

    if pos==-1:
        pos=obj[t][0]
    return len(S)*(result-1)+pos+1
print(solve())

Solution (Python):
words = lambda t : list(map(t, input().split()))
s = input()
t = input()

dict = {}
for i in range(len(s)):
    c = s[i]
    if c not in dict:
        dict[c] = []
    dict[c].append(i)

for k,v in dict.items():
    dict[k] = sorted(v)



from bisect import bisect_right
def find_min_t(cur, c):
    k = bisect_right(dict[c], cur)
    if k >= len(dict[c]):
        return dict[c][0]
    else:
        return dict[c][k]

cur = -1
ans = 0
succeed = True
for c in t:
    if c not in dict:
        succeed = False
        break
    i = find_min_t(cur, c)
    
    if i <= cur:
        ans += len(s)
    cur = i

if succeed:
    print(ans + cur + 1)
else:
    print(-1)

Solution (Python):
from bisect import *

S = input()
T = input()

ds = {}
for i,s in enumerate(S) :
    if s not in ds :
        ds[s] = [i]
    else :
        ds[s].append(i)
L = []
ind = -1
flg = 0
cnt = 0
for t in T :
    if t not in ds :
        ans = -1
        flg = 1
        break
if flg == 0 :
    for t in T :
        if ind >= ds[t][-1] :
            ind = ds[t][0]
            L.append(ind)
            cnt += 1
        else :
            ind = ds[t][bisect_right(ds[t], ind)]
            L.append(ind)
    ans = cnt * len(S) + L[-1] + 1
"""
    cnt = 0
    val = L[0]
    for i in range(1,len(L)) :
        if val >= L[i] :
            val = L[i]
            cnt += 1
"""
    
print(ans)

Solution (Python):



import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 


ss = input()
t = input()

s = ss+ss


l = len(s)
d = [[-1]*26 for _ in range(l)]

prev = [-1]*27

ans = -1
for i,c in enumerate(s):



    for k in range(max(0,prev[ord(c)-97]),i):
        d[k][ord(c)-97] = i

    prev[ord(c)-97] = i




ans = ss.find(t[0])
if ans == -1:
    print(-1)
    exit()

ls = len(ss)

lt = len(t)-1

res = ans
for i in range(lt):

    if d[res][ord(t[i+1])-97] == -1:
        print(-1)
        exit()
    diff = d[res][ord(t[i+1])-97] - res 
    ans += diff
    res = (res+diff)%ls


print(ans+1)

Solution (Python):

import sys


S = list(input())
T = list(input())

alpha2num = lambda c: ord(c) - ord('a') 

alpha = [[] for _ in range(26)]
for i,s in enumerate(S):
    alpha[alpha2num(s)].append(i)

import bisect
tmp = -1
N = len(S)
base = 0
for t in T:
    a = alpha2num(t)
    if len(alpha[a]) == 0:
        print(-1)
        sys.exit()
    else:
        L = len(alpha[a])        
        num = bisect.bisect_right(alpha[a],tmp)
        
        if num == L:
            base += 1
            tmp = alpha[a][0]
        else:
            tmp = alpha[a][num]
ans = N * base + tmp + 1
print(ans)

Solution (Python):
import bisect

s = input()
t = input()

sset = set(s)
tset = set(t)

if not all(i in sset for i in tset):
    print(-1)
    exit()

d = {}

for x in tset:
    d[x] = sorted([j for j,y in enumerate(s) if x == y])

rep = 0
tmp = d[t[0]][0]

n = len(t)

for i in range(1,n):
    k = d[t[i]]
    x = bisect.bisect_right(k,tmp)
    if x == len(k):
        rep += 1
        tmp = k[0]
    else:
        tmp = k[x]

print(rep*len(s) + tmp +1)

Solution (Python):
from bisect import bisect_right

S = input()
T = input()

s_len = len(S)

indexs_by_char = dict([s, []] for s in (S))
for i, s in enumerate(S):
    indexs_by_char[s].append(i)

indexs_len = dict([[k, len(v)] for k, v in indexs_by_char.items()])


s_count = 0
current_i = -1
for t in T:
    if t not in indexs_by_char:
        print(-1)
        exit()
    j = None
    while True:
        j = bisect_right(indexs_by_char[t], current_i)
        if j < indexs_len[t]:
            break
        s_count += 1
        current_i = -1
    current_i = indexs_by_char[t][j]

print(s_len*s_count + current_i+1)

Solution (Python):
s=input()
t=input()
i=0
index=-1
ans=0
while i<len(t):
  if t[i] not in s:
    break
  elif t[i] not in s[index+1:]:
    ans+=len(s)-index+s.index(t[i])
    index=s.index(t[i])
    i+=1
  else:
    ans+=s[index+1:].index(t[i])+1
    index+=s[index+1:].index(t[i])+1
    i+=1
print(ans if i==len(t) else -1)

Solution (Python):
s = input()
t = input()
n = 0
c = 0
for e in t:
    try:
        i = s[c:].index(e)
        n += i + 1
        c = (c + i + 1) % len(s)
    except ValueError:
        try:
            i = s.index(e)
            n += len(s) - c + i + 1
            c = i + 1
        except ValueError:
            n = -1
            break
print(n)

Solution (Python):
from collections import defaultdict
from bisect import bisect_left

s = input()
t = input()

len_s = len(s)
indices = defaultdict(list)
for i in range(len_s):
    indices[s[i]].append(i + 1)

letters_s = set(indices.keys())
letters_t = set(t)
if letters_t <= letters_s:
    cycles = 0
    cur = 0
    for ti in t:
        index = bisect_left(indices[ti], cur + 1)
        if index == len(indices[ti]):
            cycles += 1
            cur = indices[ti][0]
        else:
            cur = indices[ti][index]
    ans = len_s * cycles + cur
else:
    ans = -1
print(ans)

Solution (Python):

from bisect import bisect_left
s= input()
t = input()

d = {}
n = len(s)
ans = 0
for i in range(len(s)):
    if s[i] not in d:
        d[s[i]] = [i+1]
    else:
        d[s[i]].append(i+1)

flag = True
bef = 0
befchar = ""
for c in t:
    if c not in d:
        flag = False
        break
    else:
        if c == befchar:
            temp = bisect_left(d[c],bef)
            
            if temp == len(d[c]):
                temp = d[c][0]
                ans += temp + (n-bef)
                bef = temp
            else:
                if temp +1 < len(d[c]):
                    temp = d[c][temp+1]
                    ans += temp-bef
                    bef = temp
                else:
                    temp = d[c][0]
                    ans += temp + (n - bef)
                    bef = temp
        else:
            temp = bisect_left(d[c],bef)
            if temp == len(d[c]):
                temp = d[c][0]
                ans += temp + (n-bef)
                bef = temp
            else:
                temp = d[c][temp]
                ans += temp-bef
                bef = temp
    
    befchar=c
    

if flag:
    print(ans)
else:
    print(-1)

Solution (Python):
import collections
import bisect
s = input()
t = input()
if not set(t).issubset(set(s)): print(-1)
else:
    d = collections.defaultdict(list)
    for i, letter in enumerate(s):
        d[letter].append(i+1)
    prev = 0
    cnt = 0
    for target in t:
        li = d[target]
        idx = bisect.bisect_left(li, prev+1)
        if idx == len(li):
            cnt += 1
            prev = li[0]
        else:
            prev = li[idx]
    print(cnt * len(s) + prev)

Solution (Python):


from math import *
from collections import *
from itertools import *
from functools import *
from random import *
def getl(t=int): return [t(x) for x in input().split()]
def get(t=int): return t(input())
alphabet = [chr(x) for x in range(ord('a'), ord('z')+1)]
alnum = lambda x: ord(x) - ord('a')

def main():
	a = input()
	b = input()
	n = len(a)
	next_ = [next_arr(alphabet[i], a) for i in range(26)]
	ptr = -1
	ans = 0
	for ch in b:
		old_ptr = ptr
		ptr = next_[alnum(ch)][ptr]
		if ptr == -1:
			print(-1)
			exit()
		if ptr <= old_ptr:
			ans += n
	print(ans+ptr+1)

def next_arr(ch, a):
	n = len(a)
	i = a.find(ch)
	if i == -1:
		return [-1] * n
	ret = [-1] * n
	while ret[prev(i,n)] == -1:
		if a[i] == ch:
			ret[prev(i,n)] = i
		else:
			ret[prev(i,n)] = ret[i]
		i = prev(i,n)
	return ret


def next(i, n):
	return (i+1) % n
def prev(i, n):
	return (i-1+n) % n

if __name__ == "__main__":
	main()

Solution (Python):
import sys
import bisect


def input():
    return sys.stdin.readline()[:-1]


def main():
    s = input()
    t = input()

    dic = {"q": [], "w": [], "e": [], "r": [], "t": [], "y": [], "u": [], "i": [], "o": [], "p": [], "l": [], "k": [], "j": [
    ], "h": [], "g": [], "f": [], "d": [], "s": [], "a": [], "z": [], "x": [], "c": [], "v": [], "b": [], "n": [], "m": []}
    now = 0
    ans = 0
    
    
    
    
    for i in range(len(s)):
        dic[s[i]].append(i+1)
    for t1 in t:
        if len(dic[t1]) < 1:
            print(-1)
            sys.exit()

        old = now
        now = dic[t1][bisect.bisect_right(dic[t1], now) % len(dic[t1])]
        if old >= now:
            ans += 1
        

    ans = ans*len(s)+now

    
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):

import sys
input = sys.stdin.readline

def main():
    S = input().rstrip()
    T = input().rstrip()
    if set(T) <= set(S):
        lim_s, lim_t = len(S) - 1, len(T)
        ans, cur, idx = 1, 0, -1
        while cur < lim_t:
            x = S[idx + 1 :].find(T[cur])
            if x == -1:
                ans += 1
                idx = -1
            else:
                idx += x + 1
                cur += 1
        ans = (ans - 1) * (lim_s + 1) + idx + 1
        print(ans)
    else:  
        print(-1)


if __name__ == "__main__":
    main()

Solution (Python):
import sys
input = sys.stdin.readline

s = input().strip()
t = input().strip()
n = len(s)
m = len(t)
p = 0
q = 0
fold = 0
l = [[] for _ in range(26)]
lim = [0 for _ in range(26)] 
for i, x in enumerate(s):
	l[ord(x) - 97].append(i)
	lim[ord(x) - 97] += 1
r = [0 for _ in range(26)]
cur = -1
while (q < m):
	x = t[q]
	ind = ord(x) - 97
	
	if l[ind] == []:
		print(-1)
		exit(0)
	else:
		
		if r[ind] >= lim[ind]:
			fold += 1
			r = [0 for _ in range(26)]
			cur = -1
		else:
			c = l[ind][r[ind]]
			flag = True
			while (c <= cur):
				r[ind] += 1
				if r[ind] >= lim[ind]:
					flag = False
					break
				c = l[ind][r[ind]]
			if flag == False:
				fold += 1
				r = [0 for _ in range(26)]
				cur = -1
			elif c > cur:
				cur = c
				q += 1
				r[ind] += 1
			else:
				fold += 1
				r = [0 for _ in range(26)]
				cur = -1

print(fold * n + cur + 1)

Solution (Python):
s=input()
t=input()
ans=0
s1=s
ans=0
flag=1
for i in t:
    if i not in s1:
        flag=0
if flag==0:
    print(-1)
else:
    for i in t:
        if i in s1:
            ans+=s1.index(i)+1
            s1=s1[s1.index(i)+1:]
        else:
            ans = ((ans+len(s)-1)//len(s))*len(s) 
            ans+=s.index(i)+1   
            s1=s[s.index(i)+1:]
    print(ans)

Solution (Python):
import bisect

s = input()
t = input()





results = {}
for i in range(len(s)):
    results.setdefault(s[i], []).append(i+1)



ans = 0
cnt = 0
num = 1

for i in range(len(t)):
    
    if not t[i] in results.keys():
        print(-1)
        exit()
    else:
        idx = bisect.bisect_right(results[t[i]],cnt)
        
        if len(results[t[i]]) <= idx:
            cnt = results[t[i]][0]
            ans = len(s)*num + cnt
            num += 1
        else:
            
            ans += results[t[i]][idx] - cnt
            cnt = results[t[i]][idx]
            
print(ans)

Solution (Python):
from collections import defaultdict
from bisect import bisect_left, bisect, insort_left, insort
def solve():
    S = input()
    T = input()
    if not set(T) <= set(S):
        return -1
    len_s = len(S)
    m = defaultdict(list)
    for i, s in enumerate(S):
        m[s].append(i)
    for k, v in m.items():
        m[k].append(m[k][0] + len_s)
    last = S.index(T[0])
    ans = last + 1
    for t in T[1:]:
        num = bisect(m[t], last)
        ans += m[t][num] - last
        last = m[t][num] % len_s
    return ans
print(solve())

Solution (Python):
import bisect
s = input()
t = input()

s_len = len(s)
t_len = len(t)

n = [[] for i in range(28)]

def get_ord(c):
    return ord(c)-97

for i in range(s_len):
    ord_c = get_ord(s[i])
    n[ord_c].append(i)






def get_ans():
    res = 0
    for i in range(t_len):
        
        rr = res % s_len
        t_ord = get_ord(t[i])
        words = n[t_ord]
        
        if(len(words)==0):
            return -1
        if(i==0 and words[0] == 0):
            res = 0
            continue
    
        if(words[len(words)-1]<=rr):
            res += s_len - rr 
            
            rr = -1
        
        bis = bisect.bisect_right(words,rr)
        
        w = words[bis]


        if(rr!=-1):
            res += w - rr
        else:
            res += w
        
    
    return res+1

print(get_ans())

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]



def bin_gte(arr, n):
    l = 0
    r = len(arr) - 1
    c = (l+r)//2
    while l < r:
        c = (l+r)//2
        if arr[c] >= n:
            r = c
        else :
            l = c+1
    c = max(0, (l+r)//2)
    if arr[c] >= n:
        return (c, arr[c])
    else:
        return None


s = input()
t = input()
n = len(s)
m = len(t)
appears = [ [] for _ in range(26)]
for i,app in enumerate(appears):
    char = chr(ord('a') + i)
    base = 0
    while True:
        f = s.find(char, base)
        if f == -1:
            break
        app.append(f)
        base = f+1

cur = 0
loop = 0
for char in t:
    appear = appears[ord(char) - ord('a')]
    if len(appear) == 0:
        print('-1')
        exit()

    nex = bin_gte(appear, cur)

    if nex == None:
        loop += 1
        cur = appear[0]+1
    else:
        cur = nex[1]+1

print(loop * n + cur)

Solution (Python):
def listan(a,x):
    naga=len(a)
    if(x>=a[naga-1]):
        return -1
    if(x<a[0]):
        return a[0]
    left=0
    right=naga-1
    while(left<=right):
        center=(left+right)//2
        if(a[center]<=x and x<a[center+1]):
            return a[center+1]
        if(a[center+1]<=x):
            left=center+1
        if(a[center]>x):
            right=center-1


list=[0,1,4,5,7,9,11]
b=[1,5,10,13]

s=input()
t=input()

sl=len(s)
tl=len(t)

taiou=[]
jisho=[]


kanou=True
for i in range(tl):
    temp=[]
    if(t[i] in jisho):
        num=jisho.index(t[i])
        taiou.append(jisho[num+1])
    else:
        for j in range(sl):
            
            if(t[i]==s[j]):
                temp.append(j)
        if(temp==[]):
            kanou=False
        jisho.append(t[i])
        jisho.append(temp)
        taiou.append(temp)
        


if(not kanou):
    print(-1)

if(kanou):
    gyou=0
    retu=-1
    for i in range(tl):
        ban=listan(taiou[i],retu)
        if(ban==-1):
            gyou+=1
            retu=taiou[i][0]
        else:
            retu=ban

    print(gyou*sl+retu+1)

Solution (Python):
S = input()
T = input()

if not set(S) >= set(T):
    print(-1)
    exit()

str_repeat_num = 0
now_idx = 0
for t in T:
    if t in S[now_idx:]:
        now_idx += S[now_idx:].index(t) + 1
    else:
        str_repeat_num += 1
        now_idx = now_idx = S[:now_idx].index(t) + 1
print(len(S) * str_repeat_num + now_idx)

Solution (Python):

def main():
    S = input()
    T = input()
    if set(T) <= set(S):
        lim_s, lim_t = len(S) - 1, len(T)
        ans, cur, idx = 1, 0, -1
        while cur < lim_t:
            x = S[idx + 1 :].find(T[cur])
            if x == -1:
                ans += 1
                idx = -1
            else:
                idx += x + 1
                cur += 1
        ans = (ans - 1) * (lim_s + 1) + idx + 1
        print(ans)
    else:  
        print(-1)


if __name__ == "__main__":
    main()