ABC D求调，挂了一个点，Hash写的

#include<iostream>
#include<cstring>
#include<string>
#include<set>
using namespace std;
const long long w=131;int len;
const long long MOD1=(long long)(1e9+7),MOD2=(long long)(1e9+9);
long long Hash[1001],Hash1[1001],p1[1001],p2[1001];
int dp[1001][101];
pair<long long,long long> H(string str){
	long long h=0,h1=0;
	int len1=str.length();
	for(int i=0;i<len1;i++){
		h*=w;h+=str[i]-'a'+1;h%=MOD1;
		h1*=w;h1+=str[i]-'a'+1;h1%=MOD2;
	}
	return(make_pair(h,h1));
//	cout<<str<<" "<<h<<endl;
}
int main(){
	string str;
	cin>>str;
	len=str.length();
	p1[0]=1;p2[0]=1;
	for(int i=0;i<len;i++){
		Hash[i+1]=Hash[i]*w+str[i]-'a'+1;Hash[i+1]%=MOD1;
		Hash1[i+1]=Hash1[i]*w+str[i]-'a'+1;Hash1[i+1]%=MOD2;
		p1[i+1]=p1[i]*w%MOD1;
		p2[i+1]=p2[i]*w%MOD2;
	}
	int n;
	cin>>n;	
	memset(dp,0x3f,sizeof(dp));dp[0][0]=0;
	for(int i=1;i<=n;i++){
		for(int j1=0;j1<=len;j1++){
			dp[i][j1]=dp[i-1][j1];
		}
		int j;cin>>j;
		for(int j1=1;j1<=j;j1++){
			string tmp;cin>>tmp;
			auto k1=H(tmp);
			int len1=tmp.length();
			for(int k=len;k>=len1;k--){
			if((make_pair(((Hash[k]-p1[len1]*Hash[k-len1])%MOD1+MOD1)%MOD1,((Hash1[k]-p2[len1]*Hash1[k-len1])%MOD2+MOD2)%MOD2))==k1){
				dp[i][k]=min(dp[i-1][k],dp[i-1][k-len1]+1);
				}
			}			
		}		
	}	
	if(dp[n][len]==0x3f3f3f3f){
		cout<<-1;
	}else{
		cout<<dp[n][len];
	}
}