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 in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) {
	InputStream inputStream = System.in;
	OutputStream outputStream = System.out;
	MyInput in = new MyInput(inputStream);
	PrintWriter out = new PrintWriter(outputStream);
	TaskX solver = new TaskX();
	solver.solve(1, in, out);
	out.close();
    }

    static int INF = 1 << 30;
    static long LINF = 1L << 55;
    static int MOD = 1000000007;
    static int[] mh4 = { 0, -1, 1, 0 };
    static int[] mw4 = { -1, 0, 0, 1 };
    static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
    static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

    static class TaskX {

	public void solve(int testNumber, MyInput in, PrintWriter out) {

	    char[] s = in.nextChars(), t = in.nextChars();
	    int n = s.length, m = t.length;

	    int[][] dp = new int[n+1][26];
	    fill(dp, -1);

	    for (int i = n-1; i >= 0; i--) {
		for (char j = 'a'; j <= 'z'; j++) {
		    dp[i][j-'a'] = dp[i+1][j-'a'];
		    if (s[i] == j) {
			dp[i][j-'a'] = i+1;
		    }
		}
	    }

	    long cnt = 0;
	    int idx = 0;
	    for (int i = 0; i < m; i++) {

		if (idx == -1) {
		    out.println(-1);
		    return;
		}

		char c = t[i];
		idx = dp[idx][c-'a'];
		if (idx == -1) {
		    cnt++;
		    idx = dp[0][c-'a'];
		}
	    }
	    out.println(cnt * n + idx);
	}
    }

    static void fill(int[][] a, int v) {
	for (int i = 0; i < a.length; i++) {
	    for (int j = 0; j < a[0].length; j++) {
		a[i][j] = v;
	    }
	}
    }

    static class MyInput {
	private final BufferedReader in;
	private static int pos;
	private static int readLen;
	private static final char[] buffer = new char[1024 * 8];
	private static char[] str = new char[500 * 8 * 2];
	private static boolean[] isDigit = new boolean[256];
	private static boolean[] isSpace = new boolean[256];
	private static boolean[] isLineSep = new boolean[256];

	static {
	    for (int i = 0; i < 10; i++) {
		isDigit['0' + i] = true;
	    }
	    isDigit['-'] = true;
	    isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
	    isLineSep['\r'] = isLineSep['\n'] = true;
	}

	public MyInput(InputStream is) {
	    in = new BufferedReader(new InputStreamReader(is));
	}

	public int read() {
	    if (pos >= readLen) {
		pos = 0;
		try {
		    readLen = in.read(buffer);
		} catch (IOException e) {
		    throw new RuntimeException();
		}
		if (readLen <= 0) {
		    throw new MyInput.EndOfFileRuntimeException();
		}
	    }
	    return buffer[pos++];
	}

	public int nextInt() {
	    int len = 0;
	    str[len++] = nextChar();
	    len = reads(len, isSpace);
	    int i = 0;
	    int ret = 0;
	    if (str[0] == '-') {
		i = 1;
	    }
	    for (; i < len; i++)
		ret = ret * 10 + str[i] - '0';
	    if (str[0] == '-') {
		ret = -ret;
	    }
	    return ret;
	}

	public long nextLong() {
	    int len = 0;
	    str[len++] = nextChar();
	    len = reads(len, isSpace);
	    int i = 0;
	    long ret = 0;
	    if (str[0] == '-') {
		i = 1;
	    }
	    for (; i < len; i++)
		ret = ret * 10 + str[i] - '0';
	    if (str[0] == '-') {
		ret = -ret;
	    }
	    return ret;
	}

	public char nextChar() {
	    while (true) {
		final int c = read();
		if (!isSpace[c]) {
		    return (char) c;
		}
	    }
	}

	public String nextString() {
	    return new String(nextChars());
	}

	public char[] nextChars() {
	    int len = 0;
	    str[len++] = nextChar();
	    len = reads(len, isSpace);
	    return Arrays.copyOf(str, len);
	}

	public char[][] next2DChars(int h, int w) {
	    char[][] s = new char[h][w];
	    for (int i = 0; i < h; i++) {
		s[i] = nextChars();
	    }
	    return s;
	}

	int reads(int len, boolean[] accept) {
	    try {
		while (true) {
		    final int c = read();
		    if (accept[c]) {
			break;
		    }
		    if (str.length == len) {
			char[] rep = new char[str.length * 3 / 2];
			System.arraycopy(str, 0, rep, 0, str.length);
			str = rep;
		    }
		    str[len++] = (char) c;
		}
	    } catch (MyInput.EndOfFileRuntimeException e) {
	    }
	    return len;
	}

	public int[] nextIntArray(final int n) {
	    final int[] res = new int[n];
	    for (int i = 0; i < n; i++) {
		res[i] = nextInt();
	    }
	    return res;
	}

	public int[] nextIntArray1Index(final int n) {
	    final int[] res = new int[n + 1];
	    for (int i = 1; i < n + 1; i++) {
		res[i] = nextInt();
	    }
	    return res;
	}

	public int[] nextIntArrayDec(final int n) {
	    final int[] res = new int[n];
	    for (int i = 0; i < n; i++) {
		res[i] = nextInt() - 1;
	    }
	    return res;
	}

	public long[] nextLongArray(final int n) {
	    final long[] res = new long[n];
	    for (int i = 0; i < n; i++) {
		res[i] = nextLong();
	    }
	    return res;
	}

	public long[] nextLongArray1Index(final int n) {
	    final long[] res = new long[n + 1];
	    for (int i = 1; i < n + 1; i++) {
		res[i] = nextLong();
	    }
	    return res;
	}

	public long[] nextLongArrayDec(final int n) {
	    final long[] res = new long[n];
	    for (int i = 0; i < n; i++) {
		res[i] = nextLong() - 1;
	    }
	    return res;
	}

	public double nextDouble() {
	    return Double.parseDouble(nextString());
	}

	public double[] nextDoubleArray(int n) {
	    double[] res = new double[n];
	    for (int i = 0; i < n; i++) {
		res[i] = nextDouble();
	    }
	    return res;
	}

	static class EndOfFileRuntimeException extends RuntimeException {
	}

    }

}