本来这题倒没什么,主要是我用倍增+hash+O2水到了洛谷rank1,可能是因为倍增hash的复杂度是
O(log答案)
,而别的什么SA,二分hash都是
O(logn)
,谨以纪念。
似乎还有SAM的,然而
O(n∗4)
还是跑不过我
#include<cstdio>
#include<cstring>
const int N=100100,mo=998244353;
inline int idx(char c){
if(c=='A')return 0;
if(c=='C')return 1;
if(c=='G')return 2;
if(c=='T')return 3;
}
char a[N],b[N];
int T,n,m,i,ans,c[N],d[N],e[N],f[N],x,u,v;
inline bool equaL(int l1,int r1,int l2,int r2){
return 1ll*f[l1-1]*(c[r1]-c[l1-1]+mo)%mo==1ll*f[l2-1]*(d[r2]-d[l2-1]+mo)%mo;
}
inline int lcp(int x,int y){
char j;
for(j=0;y+(1<<j)-1<=n && x+(1<<j)-1<=n && equaL(x,x+(1<<j)-1,y,y+(1<<j)-1);++j);
if(!j)return 0;
int ans=0;
for(ans=1<<(--j);j>=0;--j)
if(x+ans+(1<<j)-1<=n && y+ans+(1<<j)-1<=m && equaL(x,x+ans+(1<<j)-1,y,y+ans+(1<<j)-1))ans+=1<<j;
return ans;
}
int main(){
scanf("%d",&T);
for(i=*e=*f=1;i<=N-10;++i)e[i]=1ll*e[i-1]*4%mo,f[i]=1ll*f[i-1]*748683265%mo;
while(T--){
scanf("%s%s",a+1,b+1);
n=strlen(a+1);
m=strlen(b+1);
for(i=1;i<=n;++i)c[i]=(c[i-1]+1ll*idx(a[i])*e[i-1])%mo,d[i]=(d[i-1]+1ll*idx(b[i])*e[i-1])%mo;
ans=0;
for(i=1;i<=n-m+1;++i){
x=lcp(u=i,v=1);
u+=x+1;
v+=x+1;
if(v>m){
++ans;
continue;
}
x=lcp(u,v);
u+=x+1;
v+=x+1;
if(v>m){
++ans;
continue;
}
x=lcp(u,v);
u+=x+1;
v+=x+1;
ans+=v>m || (v+lcp(u,v)>m);
}
printf("%d\n",ans);
}
return 0;
}