哥哥们，零分求助

#include<bits/stdc++.h>
using namespace std;

const int mod=1e7+9,N=1e7+100;
int n,m;
string s1[1010],s2[100010];
int cnt[N],num[N];
bool v[N];

int power(int a,int b)
{
	int ans=1%mod;
	for(;b;b>>=1)
	{
		if(b&1)
		{
			ans=1ll*ans*a%mod;
		}
		a=1ll*a*a%mod;
	}
	return ans;
}

int Hash(string s)
{
	int k=0;
	for(int i=0;i<s.size();i++)
	{
//		cout<<s[i]<<endl;
		k=(k+power(int(s[i]-'a'),26))%mod;
	}
	return k;
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		cin>>s1[i];
		cnt[Hash(s1[i])]++;
	}
	int ans=0;
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
	{
		cin>>s2[i];
		if(cnt[Hash(s2[i])]&&!v[Hash(s2[i])])
		{
			v[Hash(s2[i])]=1;
			ans++;
		}
	}
	cout<<ans<<"\n";
	int l,r;
	memset(v,0,sizeof v);
	int CNT=0;
	for(int i=1;i<=m;i++)
	{
		r=i;
		if(!v[Hash(s2[i])])v[Hash(s2[i])]=1,CNT++;
		num[Hash(s2[i])]++;
		if(CNT==ans)break;
	}
	int minn=2e9+10;
	for(l=1;l<=m;l++)
	{
		minn=min(minn,r-l+1);
		if(--num[Hash(s2[l])]==0)
		{
			do
			{
				r++;
				num[Hash(s2[r])]++;
			}while(s2[l]!=s2[r]&&r<m);
		}
	}
	cout<<minn<<"\n";
	return 0;
}