先求出后缀数组。
对于每组询问,按rank排序,求相邻两个的lcp,按lcp从大到小合并相邻两个,用并查集维护。
#include <bits/stdc++.h>
using namespace std;
#define N 510000
#define M 3100000
#define ll long long
#define mod 23333333333333333ll
int n,m,Q;
char s[N];
int sa[N],rank[N],tr[N],has[N],bir[N];
int h[N][21],a[M],size[N],fa[N],v[N],pos[N];
ll ans;
char getc()
{
static const int LEN = 4096;
static char buf[LEN],*S=buf,*T=buf;
if(S == T)
{
T = (S=buf)+fread(buf,1,LEN,stdin);
if(S == T)return EOF;
}
return *S++;
}
int read()
{
static char ch;
static int D;
while(!isdigit(ch=getc()));
for(D=ch-'0'; isdigit(ch=getc());)
D=(D<<3)+(D<<1)+(ch-'0');
return D;
}
void reads(char *s)
{
static char ch;
while(!isalpha(ch=getc()));
for(*s=ch,s++; isalpha(ch=getc());s++)*s=ch;
}
int cmp(int x,int y,int k)
{
if(x+k>n||y+k>n)return 0;
return rank[x]==rank[y]&&rank[x+k]==rank[y+k];
}
void getsa()
{
int i,cnt;
for(i=1;i<=n;i++)has[s[i]-'a']++;
for(i=0,cnt=0;i<26;i++)if(has[i])tr[i]=++cnt;
for(i=1;i<26;i++)has[i]+=has[i-1];
for(i=1;i<=n;i++)rank[i]=tr[s[i]-'a'],sa[has[s[i]-'a']--]=i;
for(int k=1;cnt!=n;k<<=1)
{
for(i=1;i<=n;i++)has[i]=0;
for(i=1;i<=n;i++)has[rank[i]]++;
for(i=1;i<=n;i++)has[i]+=has[i-1];
for(i=n;i>=1;i--)if(sa[i]>k)tr[sa[i]-k]=has[rank[sa[i]-k]]--;
for(i=1;i<=k;i++)tr[n-i+1]=has[rank[n-i+1]]--;
for(i=1;i<=n;i++)sa[tr[i]]=i;
for(i=1,cnt=0;i<=n;i++)tr[sa[i]]=cmp(sa[i],sa[i-1],k) ? cnt:++cnt;
for(i=1;i<=n;i++)rank[i]=tr[i];
}
for(i=1;i<=n;i++)
{
if(rank[i]==1)continue;
for(int j=max(1,h[rank[i-1]][0]-1);;j++)
{
if(s[i+j-1]==s[sa[rank[i]-1]+j-1])
h[rank[i]][0]=j;
else break;
}
}
for(i=1;i<=20;i++)
for(int j=(1<<i)+1;j<=n;j++)
h[j][i]=min(h[j][i-1],h[j-(1<<i-1)][i-1]);
}
int rmq(int x,int y)
{
int t=bir[y-x];
return min(h[y][t],h[x+(1<<t)][t]);
}
int cmp1(int x,int y){return v[x]>v[y];}
int find(int x){return fa[x]==x ? x:fa[x]=find(fa[x]);}
void merge(int x,int y,int v)
{
x=find(x);y=find(y);
ans=(ans+(ll)size[x]*size[y]*v)%mod;
fa[x]=y;size[y]+=size[x];
}
int main()
{
//freopen("tt.in","r",stdin);
n=read();Q=read();reads(s+1);
getsa();
for(int i=1,j=0;i<=n;i++)
{
if(i==1<<j+1)j++;
bir[i]=j;
}
for(;Q--;)
{
m=read();ans=0;
for(int i=1;i<=m;i++)
{
a[i]=read();a[i]=rank[a[i]];
size[a[i]]=1,fa[a[i]]=a[i];
}
sort(a+1,a+1+m);
m=unique(a+1,a+1+m)-a-1;
for(int i=1;i<m;i++)
v[i]=rmq(a[i],a[i+1]),pos[i]=i;
sort(pos+1,pos+m,cmp1);
for(int i=1;i<m;i++)
merge(a[pos[i]],a[pos[i]+1],v[pos[i]]);
printf("%lld\n",ans);
}
return 0;
}