1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<stack>
#include<bitset>
#include<vector>
#include<algorithm>
#include<iostream>
#include<deque>
using namespace std;
namespace mine
{
typedef long long ll;
#define double long double
const int INF=0x3f3f3f3f;
const ll LLINF=0x3f3f3f3f3f3f3f3fll;
ll ()
{
ll ans=0;char c=getchar();int f=1;
while(c<'0' or c>'9') {if(c=='-') f=-1;c=getchar();}
while('0'<=c and c<='9') ans=ans*10+c-'0',c=getchar();
return ans*f;
}
void write(ll num)
{
if(num<0) {num=-num;putchar('-');}
if(num>9) write(num/10);
putchar('0'+num%10);
}
void writeln(int num){write(num);puts("");}
#define FR first
#define SE second
#define MP make_pair
#define pr pair<int,int>
#define PB push_back
inline void chmax(ll &x,const ll y) {x=x>y?x:y;}
inline void chmin(ll &x,const ll y) {x=x<y?x:y;}
const int MAX_N=1e5+2,MAX_M=1e6+2,MAX_T=1800010;
int f[MAX_T][26];
struct SAM
{
struct Nod{int fail,mx,siz,son[26];}p[MAX_T];
int id;
int insert(int lst,int c)
{
int now=++id;p[now].mx=p[lst].mx+1;p[now].siz++;
int a=lst;while(a and !p[a].son[c]) p[a].son[c]=now,a=p[a].fail;
if(a==0) p[now].fail=1;
else
{
int b=p[a].son[c];
if(p[b].mx==p[a].mx+1) p[now].fail=b;
else
{
int tmp=++id;p[tmp]=p[b];p[tmp].mx=p[a].mx+1;p[tmp].siz=0;
p[b].fail=p[now].fail=tmp;
while(a and p[a].son[c]==b) p[a].son[c]=tmp,a=p[a].fail;
}
}
return now;
}
vector<int> son[MAX_T];
void dfs(int x,int fa)
{
f[x][0]=fa;for(int i=1;i<=22;i++) f[x][i]=f[f[x][i-1]][i-1];
for(int t=0;t<(int)son[x].size();t++)
{
int y=son[x][t];dfs(y,x);
p[x].siz+=p[y].siz;
}
}
void pre()
{
for(int i=1;i<=id;i++) son[p[i].fail].PB(i);
memset(f,0,sizeof f);
dfs(1,0);
}
int solve(int x,int ln)
{
if(p[x].mx<=ln) return p[x].siz;
for(int i=22;i>=0;i--) if(p[f[x][i]].mx>=ln) x=f[x][i];
return p[x].siz;
}
SAM(){id=1;memset(p,0,sizeof p);}
}sam;
char str[MAX_M];int ln;
vector<int> pp[MAX_N];int pos[MAX_M];
struct Trie
{
int id;Trie(){id=1;}
void insert(int now)
{
pp[now].PB(0);
for(int x=1,i=1;i<=ln;i++)
{
int c=str[i]-'a';
if(!f[x][c]) f[x][c]=++id;
x=f[x][c];pp[now].PB(x);
}
}
queue<int> q;
void bfs()
{
q.push(1);pos[1]=1;
while(q.size())
{
int x=q.front();q.pop();
for(int i=0;i<26;i++) if(f[x][i]>0)
pos[f[x][i]]=sam.insert(pos[x],i),q.push(f[x][i]);
}
}
}tr;
void main()
{
int n;scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%s",str+1),ln=strlen(str+1),tr.insert(i);
tr.bfs();sam.pre();
int m;scanf("%d",&m);
while(m--)
{
int now=qread(),x=qread(),y=qread();
writeln(sam.solve(pos[pp[now][y]],y-x+1));
}
}
};
int main()
{
srand(time(0));
mine::main();
}
|
近期评论