题意:
给定 n n n 个由小写字母组成的字符串, q q q 次询问,每次询问 l , r , k l, r, k l,r,k,表示求 s k s_k sk 在 s l , s l + 1 , ⋯ , s r s_l, s_{l+1}, \cdots, s_r sl,sl+1,⋯,sr 中出现的次数。 ( n , q ≤ 2 × 1 0 5 ) (n, q \leq 2×10^5) (n,q≤2×105)
链接:
https://vjudge.net/problem/CodeForces-547E
解题思路:
做法一:多模式串、多主串匹配,对模式串建立 A C AC AC 自动机,建出 f a i l fail fail 树,那么模式串 s k s_k sk 匹配次数就是其代表结点子树内主串走过的次数,这里有区间 [ l , r ] [l, r] [l,r] 的主串的限制,那么就是子树内权值在 [ l , r ] [l, r] [l,r] 的个数,主席树或者前缀和拆分后扫描线 + 树状数组统计。
做法二:多主串查询子串数量问题,对主串建立后缀自动机(当然这里是广义后缀自动机),建出 p a r par par 树,那么模式串 s k s_k sk 先在自动机上跑到对应结点,在主串出现的次数就是结点 r i g h t right right 集合的大小,这里要求区间 [ l , r ] [l, r] [l,r] 的主串,那么依然是求子树内权值在 [ l , r ] [l, r] [l,r] 的个数,做法就同上了。
多模式串问题的话,
A
C
AC
AC 自动机针对模式串建立、主串跑转移,而后缀自动机针对主串建立、模式串跑转移,自动机的时空复杂度带上字符集
Σ
\Sigma
Σ,可以针对串长决定使用(如主串长
2
×
1
0
6
2×10^6
2×106,模式串总长
1
0
5
10^5
105,我没有针对什么)。
参考代码:
做法一:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) ((int)a.size())
#define pb push_back
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid (l + r >> 1)
const int maxn = 5e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
string ss[maxn];
struct Qr{
int l, r, f;
} tp[maxn];
vector<Qr> qr[maxn];
vector<int> G[maxn];
int nxt[maxn][26], fail[maxn], pos[maxn];
int dfn[maxn], siz[maxn]; ll c[maxn], ans[maxn];
int n, q, cnt, tim;
int add(){
++cnt, fail[cnt] = 0; return cnt;
}
void insert(string &s, int id){
int p = 0;
for(int i = 0; i < sz(s); ++i){
int t = s[i] - 'a';
if(!nxt[p][t]) nxt[p][t] = add();
p = nxt[p][t];
}
pos[id] = p;
}
void cFail(){
queue<int> q;
for(int i = 0; i < 26; ++i) if(int v = nxt[0][i]) q.push(v);
while(!q.empty()){
int u = q.front(); q.pop();
for(int i = 0; i < 26; ++i){
if(int v = nxt[u][i]) fail[v] = nxt[fail[u]][i], q.push(v);
else nxt[u][i] = nxt[fail[u]][i];
}
}
}
void dfs(int u){
dfn[u] = ++tim, siz[u] = 1;
for(auto &v : G[u]){
dfs(v);
siz[u] += siz[v];
}
}
#define lowb(x) ((x)&(-x))
void update(int x, int val){
while(x <= n) c[x] += val, x += lowb(x);
}
ll query(int x){
ll ret = 0;
while(x) ret += c[x], x -= lowb(x);
return ret;
}
void ac(){
cFail();
for(int i = 1; i <= cnt; ++i) G[fail[i]].pb(i);
dfs(0);
for(int i = 1; i <= n; ++i){
int p = 0;
for(int j = 0; j < sz(ss[i]); ++j){
p = nxt[p][ss[i][j] - 'a'];
qr[dfn[p]].pb({-i, 0, 0});
}
}
for(int i = 1; i <= q; ++i){
int u = pos[tp[i].f];
qr[dfn[u] - 1].pb({tp[i].l, tp[i].r, -i});
qr[dfn[u] + siz[u] - 1].pb({tp[i].l, tp[i].r, i});
}
for(int i = 1; i <= tim; ++i){
for(auto &e : qr[i]){
if(e.l < 0) update(-e.l, 1);
else{
ll ret = query(e.r) - query(e.l - 1);
int flg = e.f < 0 ? -1 : 1;
ans[abs(e.f)] += flg * ret;
}
}
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> q;
for(int i = 1; i <= n; ++i){
cin >> ss[i];
insert(ss[i], i);
}
for(int i = 1; i <= q; ++i){
cin >> tp[i].l >> tp[i].r >> tp[i].f;
}
ac();
for(int i = 1; i <= q; ++i) cout << ans[i] << "\n";
return 0;
}
做法二:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) ((int)a.size())
#define pb push_back
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid (l + r >> 1)
const int maxn = 4e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
struct Qr{
int l, r, f;
};
vector<Qr> qr[maxn];
vector<int> G[maxn];
char s[maxn];
int nxt[maxn][26], par[maxn], len[maxn], pos[maxn];
int c[maxn], dfn[maxn], siz[maxn], rk[maxn], ans[500005];
int n, q, cnt, last, tot, tim;
int add(int l){
++cnt; memset(nxt[cnt], 0, sizeof nxt[cnt]);
len[cnt] = l; return cnt;
}
void init(){
cnt = 0; last = add(0);
}
void insert(char ch){
int t = ch - 'a', p = last, cur;
if(nxt[p][t]){
int q = nxt[p][t];
if(len[q] == len[p] + 1) { last = q; return; }
int nq = add(len[p] + 1); last = nq;
memcpy(nxt[nq], nxt[q], sizeof nxt[q]);
par[nq] = par[q], par[q] = nq;
while(p && nxt[p][t] == q) nxt[p][t] = nq, p = par[p];
return;
}
last = cur = add(len[p] + 1);
while(p && !nxt[p][t]) nxt[p][t] = cur, p = par[p];
if(!p) { par[cur] = 1; return; }
int q = nxt[p][t];
if(len[q] == len[p] + 1) { par[cur] = q; return; }
int nq = add(len[p] + 1);
memcpy(nxt[nq], nxt[q], sizeof nxt[q]);
par[nq] = par[q], par[cur] = par[q] = nq;
while(p && nxt[p][t] == q) nxt[p][t] = nq, p = par[p];
}
void dfs(int u){
dfn[u] = ++tim, rk[tim] = u, siz[u] = 1;
for(auto &v : G[u]){
dfs(v);
siz[u] += siz[v];
}
}
#define lowb(x) ((x)&(-x))
void update(int x, int val){
while(x <= n) c[x] += val, x += lowb(x);
}
int query(int x){
int ret = 0;
while(x) ret += c[x], x -= lowb(x);
return ret;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> q; init();
for(int i = 1; i <= n; ++i){
cin >> s + 1;
for(int j = 1; s[j]; ++j){
insert(s[j]);
qr[last].pb({i, i, 0});
}
pos[i] = last, last = 1;
}
for(int i = 2; i <= cnt; ++i){
G[par[i]].pb(i);
}
dfs(1);
for(int i = 1; i <= q; ++i){
int l, r, x; cin >> l >> r >> x;
x = pos[x];
int L = dfn[x], R = dfn[x] + siz[x] - 1;
qr[rk[L - 1]].pb({l, r, -i});
qr[rk[R]].pb({l, r, i});
}
for(int i = 1; i <= tim; ++i){
for(auto &e : qr[rk[i]]){
if(!e.f) update(e.l, 1);
else{
int ret = query(e.r) - query(e.l - 1);
int flg = e.f > 0 ? 1 : -1;
ans[abs(e.f)] += flg * ret;
}
}
}
for(int i = 1; i <= q; ++i) cout << ans[i] << "\n";
return 0;
}