[NOI2018]你的名字(68pts) 后缀自动机
Code:
#include <cstdio>
#include <algorithm>
#include <cstring>
#define setIO(s) freopen(s".in","r",stdin)
#define maxn 3000008
#define ll long long
#define N 30
using namespace std;
int pos[maxn],n,queries,mx[maxn];
char str[maxn],ss[maxn];
namespace SAM1{
int last,tot,dis[maxn],ch[maxn][N],f[maxn];
void init() { last=tot=1; }
void ins(int c){
int p=last,np=++tot; last=np; dis[np]=dis[p]+1;
while(p&&!ch[p][c])ch[p][c]=np,p=f[p];
if(!p) f[np]=1;
else{
int q=ch[p][c],nq;
if(dis[q]==dis[p]+1) f[np]=q;
else{
nq=++tot;
dis[nq]=dis[p]+1;
memcpy(ch[nq],ch[q],sizeof(ch[q]));
f[nq]=f[q],f[q]=f[np]=nq;
while(p&&ch[p][c]==q) ch[p][c]=nq,p=f[p];
}
}
}
void solve(){
int nn=strlen(ss),p=1,cnt=0;
for(int i=0;i<nn;++i) {
while(p&&!ch[p][ss[i]-'a']) p=f[p],cnt=dis[p];
if(!p) {p=1;cnt=0; }
else ++cnt,p=ch[p][ss[i]-'a'];
mx[i+1]=cnt;
}
}
};
namespace SAM2{
int last,tot,dis[maxn],ch[maxn][N],f[maxn];
void init(){last=++tot; }
void ins(int c,int y,int rt){
int p=last,np=++tot; last=np; dis[np]=dis[p]+1; pos[np]=y;
while(p&&!ch[p][c])ch[p][c]=np,p=f[p];
if(!p) f[np]=rt;
else{
int q=ch[p][c],nq;
if(dis[q]==dis[p]+1) f[np]=q;
else{
nq=++tot;
dis[nq]=dis[p]+1;
pos[nq]=pos[q];
memcpy(ch[nq],ch[q],sizeof(ch[q]));
f[nq]=f[q],f[q]=f[np]=nq;
while(p&&ch[p][c]==q) ch[p][c]=nq,p=f[p];
}
}
}
ll solve(int l){
ll sum=0;
for(int i=l+1;i<=tot;++i)
sum+=max(0,dis[i]-max(dis[f[i]],mx[pos[i]]));
return sum;
}
};
int main(){
//setIO("input");
scanf("%s",str),n=strlen(str),SAM1::init();
for(int i=0;i<n;++i) SAM1::ins(str[i]-'a');
scanf("%d",&queries);
while(queries--){
SAM2::init();
int rt=SAM2::tot,l,r,nn;
scanf("%s%d%d",ss,&l,&r),nn=strlen(ss);
for(int i=0;i<nn;++i) SAM2::ins(ss[i]-'a',i+1,rt);
SAM1::solve();
printf("%lld\n",SAM2::solve(rt));
}
return 0;
}