Problem Description

A subsequence of length |x| of string s = s1s2... s|s| (where |s| is the length of string s) is a string x = sk1sk2... sk|x| (1 ≤ k1 < k2 < ... < k|x| ≤ |s|).

You've got two strings — s and t. Let's consider all subsequences of string s, coinciding with string t. Is it true that each character of string s occurs in at least one of these subsequences? In other words, is it true that for all i (1 ≤ i ≤ |s|), there is such subsequence x = sk1sk2... sk|x| of string s, that x = t and for some j (1 ≤ j ≤ |x|) kj = i.

Input

The first line contains string s, the second line contains string t. Each line consists only of lowercase English letters. The given strings are non-empty, the length of each string does not exceed 2·105.

Output

Print "Yes" (without the quotes), if each character of the string s occurs in at least one of the described subsequences, or "No" (without the quotes) otherwise.

Examples

Input

abab
ab

Output

Yes

Input

abacaba
aba

Output

No

Input

abc
ba

Output

No

Note

In the first sample string t can occur in the string s as a subsequence in three ways: abab, abab and abab. In these occurrences each character of string s occurs at least once.

In the second sample the 4-th character of the string s doesn't occur in any occurrence of string t.

In the third sample there is no occurrence of string t in string s.

题意：给出两个字符串 S、T，对于 S 的每一个字符寻找一个长度与 T 相同的子串，如果这些子串均与 T 相同，那么输出 Yes，否则输出 No

思路：记录字符串 S 中每一个字符在 T 串向前、向后能匹配的位置，然后对位置进行求和比较，如果向前的位置+向后的位置大于字符串 T 的长度，则说明匹配成功

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 500000+5;
const int dx[] = {-1,1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;char s[N],t[N];
int bucketS[N],bucketT[N];
int pre[N],suf[N];
int main(){scanf("%s",s);scanf("%s",t);int sLen=strlen(s);int tLen=strlen(t);for(int i=0,j=0;i<sLen;i++){if(s[i]==t[j]&&j<tLen){bucketS[s[i]]=j;j++;}pre[i]=bucketS[s[i]];}for(int i=sLen-1,j=tLen-1;i>=0;i--){if(s[i]==t[j]&&j>=0){bucketT[s[i]]=tLen-j;j--;}suf[i]=bucketT[s[i]];}bool flag=true;for(int i=0;i<sLen;i++){if(pre[i]+suf[i]<tLen){flag=false;break;}}if(flag)printf("Yes\n");elseprintf("No\n");return 0;
}

Two Strings（CF-223B）相关推荐

【解题报告】随便练练二（CF 2300）
[解题报告]随便练练二(CF 2300) A:Antimatter | CF383D 题意思路 :DP 代码 B:Physical Education Lessons | CF915E 题意思路一 ...
Commentator problem（CF 2）
题目链接题目大意: 给定三个圆,询问是否存在点满足该点与三个圆夹角均相等,若存在多组解返回夹角最大值. 圆外一点到两圆夹角均相等: 即 sina = sinb = r1 / d1 = r2 / d2 ...
2021牛客暑期多校训练营5 D-Double Strings（dp+组合数）
D-Double Strings fi,jf_{i,j}fi,j表示a中前i个字符,b中前j个字符相同子序列的数量,容斥转移 fi,j=fi−1,j+fi,j−1−fi−1,j−1+{(1+fi−1 ...
UVA455 - Periodic Strings（周期串）
题目:Periodic Strings A character string is said to have period k if it can be formed by concatenating ...
D. Make a Power of Two（cf#739DIV3）
D. Make a Power of Two 链接: link. 题意: 找出将数字转换为 2 的任意幂的最小移动次数. 题解: 先将2的xxx次幂的结果以字符串形式保存,输入字符串nnn后,因为存在 ...
Web of Lies（CF 1548A）
这是今天在打个人赛时碰见的一道题,是一道半图论半思维的题. Web of Lies 题目大意不难理解,在这里只需要注意一些细节.在加边时,只有当cnt[min]的值为1时答案才应该减1,而不是当cnt ...
Magic Powder - 2 （CF 670_D）
http://codeforces.com/problemset/problem/670/D2 The term of this problem is the same as the previous ...
hdu6208 The Dominator of Strings（AC自动机）
题意: 给定n个串,问其中是否存在一个串,满足其他串都是它的子串. 如果存在这样的串,输出这个串,否则输出No 数据范围:所有串长度不超过1e5 解法: 答案串一定是最长的串, 如果只有一个最长的串, ...
E. You Are Given Some Strings...（AC自动机）
题目地址题目思路很明确,求t上每个位置以其结尾的串有多少个,以其为开头的串有多少个,然后遍历一遍算出贡献就行了.最后正解的思路非常简单,但我硬是整了几个假算法浪费时间,下面说一下我的心路历程. 第一 ...
【解题报告】博弈专场（CF 2000~2200）前五题
[解题报告]博弈专场 (CF 2000+)前五题 A:Fox and Card Game | CF388C 题意思路代码 B:Berzerk | CF786A 题意思路代码 C:Ithea P ...

Two Strings（CF-223B）

Problem Description

Input

Output

Examples

Note

Source Program

Two Strings（CF-223B）相关推荐

最新文章

热门文章