萌新求助

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<vector>
#include<deque>
using namespace std;
typedef long long ll;
const ll N=1e5+10,P=1e5+7,mod=1e9+7;
int i,j,n,t,k,m,len[N],r[N];ll ans,s,c[N],p[N];vector<ll> hash[N];
struct node{int len,id;node(int _x,int _y){id=_x;len=_y;}};deque<node> q;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
inline ll getans(int id,int length){
	int l=len[id]-length+1;
	return ((hash[id][len[id]]-hash[id][l-1])%mod+mod)%mod;
}
int main(){
	n=read();t=read();k=read();
	p[0]=1;for(i=1;i<=N-10;i++) p[i]=p[i-1]*P%mod;
	for(i=1;i<=t;i++){int x=read();s=(s+p[x])%mod;}
	for(i=1;i<=n;i++){
		len[i]=read();ll tmp=0;hash[i].push_back(tmp);
		for(j=1;j<=len[i];j++){
			int x=read();tmp=(tmp+p[x])%mod;hash[i].push_back(tmp);	
		}
	}
	m=read();for(i=1;i<=m;i++) r[i]=read();
	if(k<=m){
		ll now=0,pos=0;
		for(i=1;i<=k;i++){
			now+=hash[r[i]][len[r[i]]];pos+=len[r[i]];
			q.push_back(node(r[i],len[r[i]]));
			while(pos>t){
				node c=q.front();q.pop_front();
				if(pos-c.len>=t) now=((now-getans(c.id,c.len))%mod+mod)%mod,pos-=c.len;
				else{
					ll del=pos-t,length=c.len-del;pos-=del;
					now=((now-getans(c.id,c.len))%mod+mod)%mod;
					now=(now+getans(c.id,length))%mod;
					q.push_front(node(c.id,length));
				}
			}
			if(now==s) ans++;
		}
		printf("%lld\n",ans);
	}
	else{
		ll now=0,pos=0;
		for(i=1;i<=m;i++){
			now+=hash[r[i]][len[r[i]]];pos+=len[r[i]];
			q.push_back(node(r[i],len[r[i]]));
			while(pos>t){
				node c=q.front();q.pop_front();
				if(pos-c.len>=t) now=((now-getans(c.id,c.len))%mod+mod)%mod,pos-=c.len;
				else{
					ll del=pos-t,length=c.len-del;pos-=del;
					now=((now-getans(c.id,c.len))%mod+mod)%mod;
					now=(now+getans(c.id,length))%mod;
					q.push_front(node(c.id,length));
				}
			}
			ans+=(now==s);
		}
		for(i=1,k-=m;i<=m;i++){
			now+=hash[r[i]][len[r[i]]];pos+=len[r[i]];
			q.push_back(node(r[i],len[r[i]]));
			while(pos>t){
				node c=q.front();q.pop_front();
				if(pos-c.len>=t) now=((now-getans(c.id,c.len))%mod+mod)%mod,pos-=c.len;
				else{
					ll del=pos-t,length=c.len-del;pos-=del;
					now=((now-getans(c.id,c.len))%mod+mod)%mod;
					now=(now+getans(c.id,length))%mod;
					q.push_front(node(c.id,length));
				}
			}
			c[i]=c[i-1]+(now==s);
		}
		ans+=c[m]*(k/m);ans+=c[k%m];
		printf("%lld\n",ans);
	}
	return 0;
}