[hihocoder1465] 后缀自动机

[hihocoder1465]

题目描述

• 给定一个字符串S和若干个字符串T，求T的所有循环同构串在S中的出现次数
• 例如abcd的循环同构串为{abcd,bcda,cdab,dabc}

解题方法提示

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
using namespace std;
const int N=2e5;
int tr[N][26],pre[N],maxn[N],A[N],bin[N],endpos[N],v[N],last,m,n;
char t[N];
string s;
inline int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
inline void Print(ll x){if(x>9)Print(x/10);putchar(x%10+'0');}
void insert(int c){
	int p=last,x=++n,q; last=n,maxn[x]=maxn[p]+1,endpos[x]=1;
	while(p&&!tr[p][c])tr[p][c]=x,p=pre[p];
	if(!p){pre[x]=1;return;}
	if(maxn[q=tr[p][c]]==maxn[p]+1)pre[x]=q;
	else{
		int y=++n; maxn[y]=maxn[p]+1;
		memcpy(tr[y],tr[q],sizeof(tr[q]));
		pre[y]=pre[q],pre[q]=pre[x]=y;
		while(tr[p][c]==q)tr[p][c]=y,p=pre[p];
	}
}
void work(){
	scanf("%s",t+1);
	ll ans=0;
	int u=1,l=0,len=strlen(t+1);
	rep(i,len+1,len*2-1)t[i]=t[i-len];
	rep(i,1,len*2-1){
		int c=t[i]-'a';
		while(u!=1&&!tr[u][c])u=pre[u],l=maxn[u];
		if(tr[u][c])u=tr[u][c],l++;
		else u=1,l=0;
		if(l>len)while(maxn[pre[u]]>=len)u=pre[u],l=maxn[u];
		if(l>=len&&!v[u]){
			v[u]=1;
			ans+=endpos[u];
		}
	}Print(ans);puts("");
}
int main()
{
	//freopen("a.in","r",stdin);
	cin>>s;int len=s.size();
	n=last=1;
	rep(i,0,len-1)insert(s[i]-'a');
	rep(i,1,n)bin[maxn[i]]++;
	rep(i,1,n)bin[i]+=bin[i-1];
	rep(i,1,n)A[bin[maxn[i]]--]=i;
	per(i,n,1)endpos[pre[A[i]]]+=endpos[A[i]];
	m=read();
	while(m--){
		memset(v,0,sizeof(v));
		work();
	}return 0;
}