首先排除两种容易想到的情况
每次删除,必须删除偶数个,先找到最后一个,当然最后一个的时间不能小于m,因为要一一对应的话,最少也是m个。
找到了第一个,按照相同则对应一一减少,不相等则第一个每次减少偶数次,直到最后都相等。
// Problem: D. Backspace
// Contest: Codeforces - Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)
// URL: https://codeforces.com/problemset/problem/1553/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
#include<bitset>
#include<list>
#include<unordered_map>
using namespace std;
#define lowbit(x) (x&-x)
#define dbg(x) cout << #x << " = " << x << endl
#define rep(i,l,r) for(int i = l; i <= r; i++)
typedef long long ll;
typedef unsigned long long ull;
template<typename T>
inline void read(T &x)
{T f=1;x=0;char ch=getchar();while(0==isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}while(0!=isdigit(ch)) x=(x<<1)+(x<<3)+ch-'0',ch=getchar();x*=f;}
template<typename T>
inline void write(T x)
{if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
const int N=1e5+100;
char s[N],t[N];
void solve()
{
cin >> (s+1);
cin >> (t+1);
int n = strlen(s+1);
int m = strlen(t+1);
bool f = false;
if(m>n)
{
puts("NO");
return;
}
else if(m==n)
{
for(int i=1;i<=n;i++)
if(s[i] != t[i])
{
puts("NO");
return;
}
f = true;
}
else
{
int i,ii=m;
for(i=n;i>=m;i-=2) if(s[i]==t[m]) break;
for(int j=i;j>=0;j--)
{
while(j>=0&&s[j]!=t[ii]) j-=2;
if(j>=0 && s[j]==t[ii])ii--;
if(ii==0) {
f = true;
break;
}
}
}
if(f) puts("YES");
else puts("NO");
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
int Case;cin >> Case;
while(Case--)
solve();
return 0;
}