bzoj2754 [SCOI2012]喵星球上的点名（后缀数组+暴力）

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define N 2020010
inline int read(){
int 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*10+ch-'0',ch=getchar();
return x*f;
}
int a
,nn,mm,n=0,m=10000,id,bel[150000],qn[50010],vis[20010],last;
int rank[N<<1],rank1
,sa
,h
,tmp
,count
,ans[20010];
int main(){
//  freopen("a.in","r",stdin);
nn=read();mm=read();
for(int i=1;i<=nn;++i){
int nnn=read();
while(nnn--){a[++n]=read();bel
=i;}
a[++n]=++m;nnn=read();
while(nnn--){a[++n]=read();bel
=i;}a[++n]=++m;
}last=n;id=n+1;
for(int i=1;i<=mm;++i){
qn[i]=read();
for(int j=1;j<=qn[i];++j) a[++n]=read();a[++n]=++m;
}
for(int i=0;i<=m;++i) count[i]=0;
for(int i=1;i<=n;++i) count[a[i]]=1;
for(int i=1;i<=m;++i) count[i]+=count[i-1];
for(int i=n;i>=1;--i) rank[i]=count[a[i]];
int k=0;count[0]=0;
for(int p=1;k!=n;p<<=1,m=k){
for(int i=1;i<=m;++i) count[i]=0;
for(int i=1;i<=n;++i) count[rank[i+p]]++;
for(int i=1;i<=m;++i) count[i]+=count[i-1];
for(int i=n;i>=1;--i) tmp[count[rank[i+p]]--]=i;
for(int i=1;i<=m;++i) count[i]=0;
for(int i=1;i<=n;++i) count[rank[tmp[i]]]++;
for(int i=1;i<=m;++i) count[i]+=count[i-1];
for(int i=n;i>=1;--i) sa[count[rank[tmp[i]]]--]=tmp[i];
memcpy(rank1,rank,sizeof(rank1));
rank[sa[1]]=k=1;
for(int i=2;i<=n;++i){
if(rank1[sa[i]]!=rank1[sa[i-1]]||rank1[sa[i]+p]!=rank1[sa[i-1]+p]) ++k;
rank[sa[i]]=k;
}
}k=0;
for(int i=1;i<=n;++i){
if(rank[i]==1){h[1]=0;continue;}
if(i==1||h[rank[i-1]]<=1) k=0;
if(k) --k;
while(a[i+k]==a[sa[rank[i]-1]+k]) ++k;
h[rank[i]]=k;
}
for(int i=1;i<=mm;++i){
int x=rank[id],res=0;
int l=x,r=x+1;
while(h[l]>=qn[i]) --l;
while(h[r]>=qn[i]) ++r;--r;
for(int j=l;j<=r;++j){
if(sa[j]>last) continue;
if(vis[bel[sa[j]]]==i) continue;
ans[bel[sa[j]]]++;res++;
vis[bel[sa[j]]]=i;
}
printf("%d\n",res);id+=qn[i]+1;
}
for(int i=1;i<nn;++i) printf("%d ",ans[i]);
printf("%d",ans[nn]);
return 0;
}