题意
N≤100000,Q≤100000,字符串只由小写字母’a’~’z’组成
分析
一开始是想写sam的,然后发现貌似sam我只会两个log而且比sa更难写,于是还是写了sa。
这题只要把sa求出来之后根据height数组求出每个后缀有多少个本质不同的子串,然后在上面二分即可。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
const int N=100005;
int n,q,b[N],c[N],d[N],lg[N],bin[20];
char ch[N];
LL read()
{
LL 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;
}
LL sqr(int x)
{
return (LL)x*x;
}
struct Suffix_Array
{
int sa[N],rank[N*2],height[N],rmq[N][20];
LL tot[N];
void get_sa(int n,int m)
{
for (int i=1;i<=m;i++) b[i]=0;
for (int i=1;i<=n;i++) b[ch[i]]++;
for (int i=1;i<=m;i++) b[i]+=b[i-1];
for (int i=n;i>=1;i--) c[b[ch[i]]--]=i;
int t=0,j=1;
for (int i=1;i<=n;i++)
{
if (ch[c[i]]!=ch[c[i-1]]) t++;
rank[c[i]]=t;
}
while (j<=n)
{
for (int i=1;i<=n;i++) b[i]=0;
for (int i=1;i<=n;i++) b[rank[i+j]]++;
for (int i=1;i<=n;i++) b[i]+=b[i-1];
for (int i=n;i>=1;i--) c[b[rank[i+j]]--]=i;
for (int i=1;i<=n;i++) b[i]=0;
for (int i=1;i<=n;i++) b[rank[i]]++;
for (int i=1;i<=n;i++) b[i]+=b[i-1];
for (int i=n;i>=1;i--) d[b[rank[c[i]]]--]=c[i];
t=0;
for (int i=1;i<=n;i++)
{
if (rank[d[i]]!=rank[d[i-1]]||rank[d[i]]==rank[d[i-1]]&&rank[d[i]+j]!=rank[d[i-1]+j]) t++;
c[d[i]]=t;
}
for (int i=1;i<=n;i++) rank[i]=c[i];
if (t==n) break;
j*=2;
}
for (int i=1;i<=n;i++) sa[rank[i]]=i;
}
void get_height(int n)
{
int k=0;
for (int i=1;i<=n;i++)
{
if (k) k--;
int j=sa[rank[i]-1];
while (i+k<=n&&j+k<=n&&ch[i+k]==ch[j+k]) k++;
height[rank[i]]=k;
}
}
int get_lcp(int x,int y)
{
if (x==y) return n-x+1;
x=rank[x];y=rank[y];
if (x>y) swap(x,y);
x++;
int len=(y-x+1);
return min(rmq[x][lg[len]],rmq[y-bin[lg[len]]+1][lg[len]]);
}
pair<int,int> get_str(LL k)
{
int l=1,r=n;
while (l<=r)
{
int mid=(l+r)/2;
if (tot[mid]>=k) r=mid-1;
else l=mid+1;
}
int x=sa[r+1];
return make_pair(x,x+height[rank[x]]+k-tot[r]-1);
}
void pre()
{
get_sa(n,150);get_height(n);
for (int i=1;i<=n;i++) rmq[i][0]=height[i];
for (int j=1;j<=lg[n];j++)
for (int i=1;i+bin[j]-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+bin[j-1]][j-1]);
for (int i=1;i<=n;i++) tot[i]=tot[i-1]+n-sa[i]+1-height[i];
}
}A,B;
int main()
{
bin[0]=1;
for (int i=1;i<=16;i++) bin[i]=bin[i-1]*2;
n=read();q=read();
for (int i=1;i<=n;i++) lg[i]=log(i)/log(2);
scanf("%s",ch+1);A.pre();
reverse(ch+1,ch+n+1);B.pre();
while (q--)
{
LL x=read(),y=read();
if (x>A.tot[n]||y>A.tot[n]) {puts("-1");continue;}
pair<int,int> s1=A.get_str(x),s2=A.get_str(y);
int len=min(s1.second-s1.first+1,s2.second-s2.first+1);
printf("%lld\n",sqr(min(A.get_lcp(s1.first,s2.first),len))+sqr(min(B.get_lcp(n-s1.second+1,n-s2.second+1),len)));
}
return 0;
}