由题目意思可知,qk固定,小于等于
1
0
5
10^5
105
那么我们分一下类:
(1)
k
≤
q
k
k\leq\sqrt{qk}
k≤qk
每次暴力
k
2
l
o
g
2
m
k^2log_{2}m
k2log2m即可
时间复杂度:
O
(
q
k
2
l
o
g
2
m
)
O(qk^2log_{2}m)
O(qk2log2m)
(2)
q
≤
q
k
q\leq\sqrt{qk}
q≤qk
每次暴力跑m次
先预处理当前字符串1~i对应到后缀自动机上的哪个节点,然后在后缀树上倍增跳即可。
时间复杂度:
O
(
q
m
l
o
g
2
n
)
O(qmlog_{2}n)
O(qmlog2n)
爆炸的时间!!!
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
int n,m,q,K;
#define Maxn 100010
char ch[Maxn],str[Maxn];
struct Seg{
int l,r;
}seg[Maxn];
vector<int> g[405][405];
int ed[Maxn],lth[Maxn];
int fa[Maxn<<1][18];
struct Node{
int son[26],fa;
int len;
}tree[Maxn<<1];
int last=1,cnt=1;
int siz[Maxn<<1];
int ton[Maxn<<1],sa[Maxn<<1];
inline void go(int &k,int dir,int id){
lth[id]=lth[id-1];
while(k&&!tree[k].son[dir])k=tree[k].fa,lth[id]=tree[k].len;
if(!k)k=1;
else k=tree[k].son[dir],lth[id]++;
ed[id]=k;
}
inline void insert(char c){
int k=last,now=++cnt;
tree[now].len=tree[k].len+1;
int dir=c-'a';
while(k&&!tree[k].son[dir])tree[k].son[dir]=now,k=tree[k].fa;
if(!k)tree[now].fa=1;
else{
int q=tree[k].son[dir];
if(tree[q].len==tree[k].len+1)tree[now].fa=q;
else{
int nq=++cnt;
tree[nq]=tree[q];
tree[nq].len=tree[k].len+1;
tree[q].fa=tree[now].fa=nq;
while(k&&tree[k].son[dir]==q)tree[k].son[dir]=nq,k=tree[k].fa;
}
}
last=now;
siz[now]=1;
}
inline void solve(){
for(register int i=1;i<=cnt;++i)ton[tree[i].len]++;
for(register int i=1;i<=cnt;++i)ton[i]+=ton[i-1];
for(register int i=cnt;i>=1;--i)sa[ton[tree[i].len]--]=i;
for(register int i=cnt;i>=1;--i){
int k=sa[i];
siz[tree[k].fa]+=siz[k];
fa[k][0]=tree[k].fa;
}
for(int i=1;i<=17;++i)
for(int u=1;u<=cnt;++u)fa[u][i]=fa[fa[u][i-1]][i-1];
siz[0]=0;
}
inline void rd(int &x){
x=0;char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
}
int main(){
rd(n);rd(m);rd(q);rd(K);
int all=(q*K),unit=sqrt(all);
scanf("%s",ch+1);
for(register int i=1;i<=n;++i)insert(ch[i]);
for(register int i=1;i<=m;++i){
rd(seg[i].l);rd(seg[i].r);
seg[i].l++;seg[i].r++;
}
solve();
if(K<=unit){
for(register int i=1;i<=m;++i)g[seg[i].l][seg[i].r].push_back(i);
for(register int i=1;i<=K;++i)
for(register int j=1;j<=K;++j)
sort(g[i][j].begin(),g[i][j].end());
int a,b;
while(q--){
scanf("%s",str+1);
rd(a);rd(b);a++;b++;
ll Ans=0;
for(register int i=1;i<=K;++i){
int k=1;
for(register int j=i;j<=K;++j){
k=tree[k].son[str[j]-'a'];
if(!k)break;
int l1=lower_bound(g[i][j].begin(),g[i][j].end(),a)-g[i][j].begin();
int l2=upper_bound(g[i][j].begin(),g[i][j].end(),b)-g[i][j].begin();
Ans+=1ll*(l2-l1)*siz[k];
}
}
printf("%lld\n",Ans);
}
}else{
int a,b;
while(q--){
scanf("%s",str+1);
rd(a);rd(b);a++;b++;
ll Ans=0;
int k=1;
for(register int i=1;i<=K;++i)go(k,str[i]-'a',i);
for(register int i=a;i<=b;++i){
int k=ed[seg[i].r],len=seg[i].r-seg[i].l+1;
if(lth[seg[i].r]<len)continue;
for(register int j=17;j>=0;--j)
if(tree[fa[k][j]].len>=len)k=fa[k][j];
Ans+=siz[k];
}
printf("%lld\n",Ans);
}
}
return 0;
}