C. Obtain The String

194 篇文章 1 订阅
1 篇文章 0 订阅

链接:https://codeforces.com/contest/1295/problem/C

You are given two strings ss and tt consisting of lowercase Latin letters. Also you have a string zz which is initially empty. You want string zz to be equal to string tt. You can perform the following operation to achieve this: append any subsequence of ss at the end of string zz. A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements. For example, if z=acz=ac, s=abcdes=abcde, you may turn zz into following strings in one operation:

  1. z=acacez=acace (if we choose subsequence aceace);
  2. z=acbcdz=acbcd (if we choose subsequence bcdbcd);
  3. z=acbcez=acbce (if we choose subsequence bcebce).

Note that after this operation string ss doesn't change.

Calculate the minimum number of such operations to turn string zz into string tt.

Input

The first line contains the integer TT (1≤T≤1001≤T≤100) — the number of test cases.

The first line of each testcase contains one string ss (1≤|s|≤1051≤|s|≤105) consisting of lowercase Latin letters.

The second line of each testcase contains one string tt (1≤|t|≤1051≤|t|≤105) consisting of lowercase Latin letters.

It is guaranteed that the total length of all strings ss and tt in the input does not exceed 2⋅1052⋅105.

Output

For each testcase, print one integer — the minimum number of operations to turn string zz into string tt. If it's impossible print −1−1.

Example

input

Copy

3
aabce
ace
abacaba
aax
ty
yyt

output

Copy

1
-1
3

代码:

#include<bits/stdc++.h>
using namespace std;
char a[100005],b[100005];
long long p[100005][26],n,m;
int main(){
	long long t;
	scanf("%lld\n",&t);
	while(t--)
	{
		scanf("%s",a);
		scanf("%s",b);
		n=strlen(a);
		m=strlen(b);
		for(int i=0;i<26;i++) 
		{
			p[n][i]=-1;
		} 
		for(int i=n-1;i>=0;i--)
		{
			for(int j=0;j<26;j++) 
			p[i][j]=p[i+1][j];
			p[i][a[i]-'a']=i;
		}
		long long ans=1,pe=0,flag=0;
		while(pe<m)
		{
			if(p[flag][b[pe]-'a']==-1)
			{
				if(flag==0)
				{
					ans=-1;
					break;
				}
				else
				{
					flag=0,ans++;
					continue;
				}
			}
			flag=p[flag][b[pe]-'a']+1;
			pe++;
		}
		printf("%d\n",ans);
	}
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值