关于本题数据正确性的疑问

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const long long inf = 1e18;
const long long mod = 998244353;
int n , m;
string x[200005] , y[200005];
map<pair<string , string> , vector<int> >a;
bool check(string s1 , string s2)
{
	int cnt = 0;
	for(int i = 0 ; i < s1.size() ; i++)
	{
		if(s1[i] == s2[cnt])cnt++;
		else cnt = 0;
		if(cnt == s2.size())return 1;
	}
	return 0;
}
signed main()
{
	cin.tie(0) , cout.tie(0);
	ios::sync_with_stdio(0);
//	freopen("ce.in" , "r" , stdin);
//	freopen("ce.out" , "w" , stdout);
	cin>>n>>m;
	string xx , yy;
	int l , r;
	for(int i = 1 ; i <= n ; i++)
	{
		xx = "" , yy = "";
		cin>>x[i]>>y[i];
		l = 0 , r = x[i].size();
		for(l = 0 ; l < r ; l++)if(x[i][l] != y[i][l])break;
		for(r = x[i].size() ; r > l ; r--)if(x[i][r] != y[i][r])break;
		
		for(int j = l ; j <= r ; j++)xx += x[i][j] , yy += y[i][j];
		a[make_pair(xx , yy)].push_back(i);
	}
	string sx , sy;
	int ans;
	for(int i = 1 ; i <= m ; i++)
	{
		cin>>sx>>sy;
		ans = 0;
		xx = "" , yy = "";
		l = 0 , r = sx.size();
		if(sx.size() != sy.size())
		{
			cout<<0<<endl;
			continue;
		}
		for(l = 0 ; l < r ; l++)if(sx[l] != sy[l])break;
		for(r = sx.size() ; r > l ; r--)if(sx[r] != sy[r])break;
		
		for(int j = l ; j <= r ; j++)xx += sx[j] , yy += sy[j];
		for(int j : a[make_pair(xx , yy)])
		{
			if(check(sx , x[j]))ans++;
		}
		cout<<ans<<endl;
	}
	
	
	
	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const long long inf = 1e18;
const long long mod = 998244353;
int n , m;
string x[200005] , y[200005];
map<pair<string , string> , vector<int> >a;
bool check(string s1 , string s2)
{
	int cnt = 0;
	for(int i = 0 ; i < s1.size() ; i++)
	{
		if(s1[i] == s2[cnt])cnt++;
		else cnt = 0;
		if(cnt == s2.size())return 1;
	}
	return 1;
}
signed main()
{
	cin.tie(0) , cout.tie(0);
	ios::sync_with_stdio(0);
//	freopen("ce.in" , "r" , stdin);
//	freopen("ce.out" , "w" , stdout);
	cin>>n>>m;
	string xx , yy;
	int l , r;
	for(int i = 1 ; i <= n ; i++)
	{
		xx = "" , yy = "";
		cin>>x[i]>>y[i];
		l = 0 , r = x[i].size();
		for(l = 0 ; l < r ; l++)if(x[i][l] != y[i][l])break;
		for(r = x[i].size() ; r > l ; r--)if(x[i][r] != y[i][r])break;
		
		for(int j = l ; j <= r ; j++)xx += x[i][j] , yy += y[i][j];
		a[make_pair(xx , yy)].push_back(i);
	}
	string sx , sy;
	int ans;
	for(int i = 1 ; i <= m ; i++)
	{
		cin>>sx>>sy;
		ans = 0;
		xx = "" , yy = "";
		l = 0 , r = sx.size();
		if(sx.size() != sy.size())
		{
			cout<<0<<endl;
			continue;
		}
		for(l = 0 ; l < r ; l++)if(sx[l] != sy[l])break;
		for(r = sx.size() ; r > l ; r--)if(sx[r] != sy[r])break;
		
		for(int j = l ; j <= r ; j++)xx += sx[j] , yy += sy[j];
		for(int j : a[make_pair(xx , yy)])
		{
			if(check(sx , x[j]))ans++;
		}
		cout<<ans<<endl;
	}
	
	
	
	return 0;
}
/*

*/