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.



Sample input:
contest
son


Sample output:
10

Submission status: Accepted

Solution code:
import os
import bisect
s = input()
t = input()

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

ans = 0
current_idx = -1

for c in t:
    if c not in s_idx_map:
        print(-1)
        os.sys.exit()
    induces = s_idx_map[c]
    pos = bisect.bisect_left(induces, current_idx)
    if pos < len(induces) and induces[pos] == current_idx:
        pos += 1
    if pos < len(induces):
        ans += induces[pos] - current_idx
        current_idx = induces[pos]
    else:
        ans += (len(s)-1) - current_idx
        ans += induces[0] + 1
        current_idx = induces[0]

print(ans)

Submission status: Accepted

Solution code:
s=input()
t=input()
T = len(t)
num = 0
nowi = -1
nexti =-1
for i,ti in enumerate(t):
    nexti = s[nowi+1:].find(ti)
    if nexti == -1:
        num+=1
        nexti =s.find(ti)
        nowi = nexti
        if nexti ==-1:
            print(-1)
            exit()
    else:
        nowi = nexti+nowi+1
if num<= 10**100 -1:
    print(len(s)*num + nowi+1)

Submission status: Accepted

Solution code:
s = input()
t = input()
n = len(s)
nxt = [list() for x in range(n + 1)]
nxt[n] = [n for x in range(26)]
for i in range (n - 1, -1, -1):
    for v in nxt[i + 1]:
        nxt[i].append(v)
    nxt[i][ord(s[i]) - ord('a')] = i;
ans = 0
cur = 0
for i in range (len(t)):
    c = ord(t[i]) - ord('a')
    if (nxt[0][c] == n) :
        ans = 0
        cur = -1
        break
    if (nxt[cur][c] == n) :
        ans += 1
        cur = 0
    cur = nxt[cur][c] + 1
print(ans * n + cur)

Submission status: Accepted

Solution code:
s,t=([ord(c)-ord('a') for c in input()]for _ in'xx')
if set(t)-set(s):
  print(-1)
else:
  u=s+s
  nxt = [None for _ in range(len(u)+1)]
  nxt[len(u)]=[0 for _ in range(26)]
  for i in range(len(u)-1,-1,-1):
    nxt[i] = [v+1 for v in nxt[i+1]]
    nxt[i][u[i]]=0
  p = 0
  for c in t:
    p += nxt[p%len(s)][c]+1
  print(p)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import bisect

def solve():
  s = input().strip()
  t = input().strip()
  query = [[] for _ in range(26)]
  n = len(s)
  for i in range(n):
    alphabet = ord(s[i])-97
    query[alphabet].append(i+1)

  
  place = -1
  loops = 0
  for j in t:
    tmp = ord(j)-97
    if len(query[tmp]) == 0:
      print(-1)
      exit()
    else:      
      nextplace = bisect.bisect_right(query[tmp],place)
      if nextplace == len(query[tmp]):
        loops += 1
        place = query[tmp][0]
      else:
        place = query[tmp][nextplace]

  print(loops*n +place)
solve()

Submission status: Accepted

Solution code:
s = input()
t = input()
temp = s[:]
cnt = 0
strmax = len(t)
ans = 0
flag = True

while cnt<strmax:
	num = temp.find(t[cnt])
	if num != -1:
		ans+=num+1
		temp = temp[num+1:]
		cnt+=1
		flag = False
	else:
		if flag:
			print("-1")
			exit(0)
		ans+=len(temp)
		temp = s[:]
		flag = True

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
temp = s[:]
cnt = 0
strmax = len(t)
ans = 0

for i in t:
	if s.find(i)==-1:
		print("-1")
		exit(0)

while cnt<strmax:
	num = temp.find(t[cnt])
	if num != -1:
		ans+=num+1
		temp = temp[num+1:]
		cnt+=1
	else:
		ans+=len(temp)
		temp = s[:]

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
max = 10**100
now = t[0]
cnt1 = 0
cnt2 = 0

for i in t:
	if s.find(i)==-1:
		print("-1")
		exit(0)

while True:
	temp = s[:]
	if cnt2 == len(t):
		print(cnt1)
		break
	if max == 0:
		print("-1")
		break
	while True:
		num = temp.find(now)
		if num != -1:
			cnt2+=1
			cnt1+=num+1
			if cnt2 < len(t):
				now = t[cnt2]
			else:
				break
			temp = temp[num+1:]
			continue
		else:
			cnt1+=len(temp)
			break
	max-=1

Submission status: Accepted

Solution code:
import string
import bisect
S = input()
T = input()
n = len(S)
sa = {_: [] for _ in string.ascii_lowercase}
for i, s in enumerate(S):
    sa[s] += [i]
ans = 0
i = -1
for t in T:
    if sa[t]:
        j = bisect.bisect_left(sa[t], i + 1)
        if j == len(sa[t]):
            ni = sa[t][0] + n
        else:
            ni = sa[t][j]
        ans += ni - i
        i = ni % n
    else:
        print(-1)
        exit()
print(ans)

Submission status: Accepted

Solution code:
s=input()
t=input()
length=len(s)
exi={chr(97+i): False for i in range(26)}
jump={chr(97+i): [0 for _ in range(2*length)] for i in range(26)}
cru={chr(97+i):0 for i in range(26)}
pointer=0
flag=True
for i,ch in enumerate(s*2):
    exi[ch]=True
    for j in range(cru[ch],i+1):
        jump[ch][j]=1+i-j
    cru[ch]=i+1
for ch in t:
    if exi[ch]:
        pointer+=jump[ch][pointer%length]
    else:
        flag=False
        break
if flag:
    print(pointer)
else:
    print(-1)

Submission status: Accepted

Solution code:
s=input()
n=len(s)
from collections import Counter
l=Counter()
for i in "abcdefghijklmnopqrstuvwxyz":
    l[i]=[]
for i in range(n):
    l[s[i]].append(i)
t=input()
m=len(t)
ans=0
p=-1
import bisect
for i in range(m):
    c=t[i]
    ll=l[c]
    if ll==[]:
        print(-1)
        exit()
    if ll[-1]<=p:
        ans+=n
        p=ll[0]
        if i==m-1:
            ans+=p+1
    else:
        p=ll[bisect.bisect_right(ll,p)]
        if i==m-1:
            ans+=p+1
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = [ord(ss) - ord('a') for ss in input()]
    t = [ord(tt) - ord('a') for tt in input()]

    sets = set(s)
    if len([tt for tt in t if tt not in sets]) > 0:
        print(-1)
        return

    ns = len(s)
    table = [[-1] * 26 for _ in range(ns+1)]
    for i in range(ns)[::-1]:
        table[i] = table[i+1][:]
        table[i][s[i]] = i

    cur = -1
    cnt = 1
    for tt in t:
        next_cur = table[cur+1][tt]
        if next_cur == -1:
            next_cur = table[0][tt]
            cnt += 1
        cur = next_cur

    print(ns * (cnt - 1) + cur + 1)


main()

Submission status: Accepted

Solution code:
from collections import defaultdict
from bisect import bisect_right
 
s=input()
t=input()
slen=len(s)
d=defaultdict(list)
 
for i,c in enumerate(s):
    d[c].append(i)
 
nowplace=-1
roop=0
for c in t:
    if not d[c]:
        print(-1)
        exit()
    i=bisect_right(d[c],nowplace)
    if len(d[c])==i:
        roop+=1
        nowplace=d[c][0]
    else:
        nowplace=d[c][i]
 
print(roop*slen+nowplace+1)

Submission status: Accepted

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

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    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 = []  # prime factor
        b, e = 2, 0  # base, exponent
        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
        """
        # TODO: How should I do when n - r is negative?
        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 # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    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 # Deprecated since version 3.5: Use math.gcd() instead.
    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)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        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):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        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]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    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
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array, use [[0] * N for _ in range(N)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    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
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    S = r()
    T = r()
    lenS = len(S)
    lenT = len(T)
    setT = set(T)
    # dic = defaultdict(list)
    dic = [[] for _ in range(28)]
    if setT - set(S):
        print(-1)
        return
    # l = [[] for _ in range(lenT)]
    l = [0] * lenT
    for i, s in enumerate(S):
        dic[ord(s)-96].append(i)
        # if s in setT:
        #     dic[s].append(i)
    for i, t in enumerate(T):
        # l[i].extend(dic[ord(t)-96])
        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)
    

    
    
    

    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
abc=list(map(chr,range(97,123)))

s=input()
t=input()
for x in abc:
    if x in t and x not in s:
        print(-1)
        exit()
l=[[0]*len(s) for _ in [0]*26]
j=0
for x in abc:
    if x in s and x in t:
        f=s.find(x)
        k=-1
        for i in range(len(s)-1,-1,-1):
            l[j][i]=k if k>=0 else f
            if s[i]==x:k=i
    j+=1
c=0
i=-1
j=0
while j<len(t):
    k=l[abc.index(t[j])][i]
    if k<=i:c+=1
    i=k
    j+=1
print(c*len(s)+k+1)

Submission status: Accepted

Solution code:
import sys
s=str(input())
t=str(input())

for i in range(len(t)):
    if s.find(t[i])==-1:
        print(-1)
        break
else:
    a=0
    count=0
    for k in t:
        if k in s[a:]:
            a=s.find(k,a)+1
        else:
            count+=1
            a=s.find(k)+1
    print(count*len(s)+a)

Submission status: Accepted

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

if all([c in S for c in T])!=True:
	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 = S[:now_idx].index(t) + 1
print(len(S) * str_repeat_num + now_idx)

Submission status: Accepted

Solution code:
from bisect import bisect_right


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

    table = {ss: [] for ss in set(s)}
    for i, ss in enumerate(s):
        table[ss].append(i)

    cnt = 1
    cur = -1
    for tt in t:
        if tt not in table:
            print(-1)
            return
        tl = table[tt]
        idx = bisect_right(tl, cur)
        # if idx == len(tl) or tl[idx] <= cur:
        if idx == len(tl):
            idx = 0
            cnt += 1
        cur = tl[idx]
    print(len(s) * (cnt - 1) + cur + 1)


main()

Submission status: Accepted

Solution code:
import bisect

S = input()
T = input()

d = [[] for _ in range(27)]
# alpha2num = lambda c: ord(c) - ord("a") + 1
d = {chr(c): [] for c in range(ord("a"), ord("z")+1)}

for i, s in enumerate(S):
    # d[alpha2num(s)].append(i)
    d[s].append(i)

idx = -1
l = 0
ans = 0
for t in T:
    # dl = d[alpha2num(t)]
    dl = d[t]
    if not dl:
        ans = -1
        break
    insert_idx = bisect.bisect_right(dl, idx)
    if insert_idx == len(dl):
        l += 1
        idx = dl[0]
    else:
        idx = dl[insert_idx]
    ans = l * len(S) + idx + 1

print(ans)

Submission status: Accepted

Solution code:
import bisect

S = input()
T = input()

d = [[] for _ in range(27)]
alpha2num = lambda c: ord(c) - ord("a") + 1

for i, s in enumerate(S):
    d[alpha2num(s)].append(i)

idx = -1
l = 0
ans = 0
for t in T:
    dl = d[alpha2num(t)]
    if not dl:
        ans = -1
        break
    insert_idx = bisect.bisect_right(dl, idx)
    if insert_idx == len(dl):
        l += 1
        idx = dl[0]
    else:
        idx = dl[insert_idx]
    ans = l * len(S) + idx + 1

print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict
from bisect import bisect_right


def main():
    s = input()
    t = input()
    N = len(s)
    idx = defaultdict(list)
    for i in range(N):
        c = s[i]
        idx[c].append(i)
    pos = -1
    ans = 0
    for c in t:
        if c not in idx:
            print(-1)
            return
        n = bisect_right(idx[c], pos)
        if n == len(idx[c]):
            ans += N + idx[c][0] - pos
            pos = idx[c][0]
        else:
            ans += idx[c][n] - pos
            pos = idx[c][n]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import*
from bisect import*

s=input()
t=input()
slen=len(s)
d=defaultdict(list)

for i,c in enumerate(s):
    d[c].append(i)

nowplace=-1
roop=0
for c in t:
    if not d[c]:
        print(-1)
        exit()
    i=bisect(d[c],nowplace)
    if len(d[c])==i:
        roop+=1
        nowplace=d[c][0]
    else:
        nowplace=d[c][i]

print(roop*slen+nowplace+1)

Submission status: Accepted

Solution code:
s = input()
t = input()
count = 0
stock = 0
check = 0

for i in t:
    if check==0:
        if i in s:
            stock = s.index(i)
            check = 1
        else:
            count = -1
            break
    else:
        if i in s:
            if stock==len(s)-1:
                count += 1
                stock = s.index(i)
                continue
            if i in s[stock+1:]:
                stock = s[stock+1:].index(i) + stock + 1
                continue
            else:
                count += 1
                stock = s.index(i)
                continue
        else:
            count = -1
            break
        
if count==-1:
    print(count)
else:
    print(count*len(s)+stock+1)

Submission status: Accepted

Solution code:
S=input()
T=input()
dp=[[10**6]*len(S) for i in range(26)]
for i,s in enumerate(S):
    dp[ord(s)-ord('a')][i]=0
for i in range(len(S)-1,-1,-1):
    for j in range(26):
        dp[j][i-1]=min(dp[j][i-1],dp[j][i]+1)
for i in range(len(S)-1,-1,-1):
    for j in range(26):
        dp[j][i-1]=min(dp[j][i-1],dp[j][i]+1)
x=0
i=-1
for t in T:
    ti=ord(t)-ord('a')
    if dp[ti][i]<1e6:
        x+=dp[ti][i+1-len(S)]+1
        i=(i+dp[ti][i+1-len(S)]+1)%len(S)
    else:
        x=-1
        break
print(x)

Submission status: Accepted

Solution code:
import sys
def main():
  _ord, _range = ord, range
  s = input()
  t = input()
  tset = set(t)
  slen = len(s)
  aord = _ord('a')
  if len(tset - set(s)) != 0:
      print(-1)
      sys.exit()
  s2t = [i - aord for i in (s + s).encode('ascii')]
  lut = [[-1 for _ in _range(slen)] for _ in _range(26)]
  for c in tset:
    b = _ord(c) - aord
    j = 0
    for i in _range(slen * 2 - 1, -1, -1):
      if s2t[i] == b:
        j = 0
      else:
        j += 1
      if i < slen:
        lut[b][i] = j
  p = 0
  for c in t:
    b = _ord(c) - aord
    p += lut[b][p % slen] + 1
  print(p)
main()

Submission status: Accepted

Solution code:
import sys

s = input()
t = input()

tset = set(t)
slen = len(s)

if len(tset - set(s)) != 0:
    print(-1)
    sys.exit()

s2t = [i - ord('a') for i in (s + s).encode('ascii')]
lut = [[-1 for _ in range(slen)] for _ in range(26)]
for c in tset:
  b = ord(c) - ord('a')
  j = 0
  for i in range(slen * 2 - 1, -1, -1):
    if s2t[i] == b:
      j = 0
    else:
      j += 1
    if i < slen:
      lut[b][i] = j

p = 0
for c in t:
  b = ord(c) - ord('a')
  p += lut[b][p % slen] + 1
print(p)