洛谷 AC自动机模板题三连

简单版

题意

给你n个模式串s，和一个文本串t求有几个模式串出现过

思路

ac自动机板子题，建完自动机在自动机上跑一下就好

代码

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int N = 1000005;
const int M = 26;

struct ACAM {
    int nxt[N][M], fail[N], val[N], n;
    void init() {
        memset(nxt,0,sizeof(nxt));
        memset(fail,0,sizeof(fail));
        memset(val,0,sizeof(val));
        n = 0;
    }
    void add(char *s) {
        int len = strlen(s), now = 0;
        for(int i = 0; i < len; ++i) {
            int tmp = s[i]-'a';
            if(!nxt[now][tmp]) nxt[now][tmp] = ++n;
            now = nxt[now][tmp];
        }
        ++val[now];
    }
    void getfail() {
        queue<int> q;
        for(int i = 0; i < 26; ++i) if(nxt[0][i]) fail[nxt[0][i]] = 0, q.push(nxt[0][i]);
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(int i = 0; i < 26; ++i) {
                if(nxt[u][i]) fail[nxt[u][i]] = nxt[fail[u]][i], q.push(nxt[u][i]);
                else nxt[u][i] = nxt[fail[u]][i];
            }
        }
    }
    int query(char *s) {
        int len = strlen(s);
        int now = 0, ans = 0;
        for(int i = 0; i < len; ++i) {
            now = nxt[now][s[i]-'a'];
            for(int t = now; t && ~val[t]; t = fail[t]) ans += val[t], val[t] = -1;
        }
        return ans;
    }
}ac;

char s[N];

int main() {
    int n;
    scanf("%d",&n);
    ac.init();
    for(int i = 0; i < n; ++i) scanf("%s",s), ac.add(s);
    ac.getfail();
    scanf("%s",s);
    printf("%d\n",ac.query(s));
    return 0;
}

---

加强版

题意

求出现次数最多的模式串，并列最多按出现顺序输出

思路

对ac自动机fail指针反向建树，根据ac自动机性质可知，子树出现的串父亲必定也会出现，所以每个节点统计子树大小。

代码

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int N = 155*75;
const int M = 26;

char st[155][75], t[1000005];

struct ACAM {
    int nxt[N][M], fail[N], val[N], n;
    int cnt[N], pos[155], tid;
    void init() {
        memset(nxt,0,sizeof(nxt));
        memset(fail,0,sizeof(fail));
        memset(val,0,sizeof(val));
        memset(cnt,0,sizeof(cnt));
        memset(pos,0,sizeof(pos));
        n = 0;
        tid = 0;
    }
    void add(char *s) {
        int len = strlen(s), now = 0;
        for(int i = 0; i < len; ++i) {
            int tmp = s[i]-'a';
            if(!nxt[now][tmp]) nxt[now][tmp] = ++n;
            now = nxt[now][tmp];
        }
        pos[tid++] = now;
        ++val[now];
    }
    void getfail() {
        queue<int> q;
        for(int i = 0; i < 26; ++i) if(nxt[0][i]) fail[nxt[0][i]] = 0, q.push(nxt[0][i]);
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(int i = 0; i < 26; ++i) {
                if(nxt[u][i]) fail[nxt[u][i]] = nxt[fail[u]][i], q.push(nxt[u][i]);
                else nxt[u][i] = nxt[fail[u]][i];
            }
        }
    }

    vector<int> e[N];
    void dfs(int u) {
        for(auto v : e[u]) {
            dfs(v);
            cnt[u] += cnt[v];
        }
    }
    void solve(char *s) {
        int len = strlen(s);
        int now = 0, ans = 0;
        for(int i = 0; i < len; ++i) {
            now = nxt[now][s[i]-'a'];
            ++cnt[now];
        }
        for(int i = 1; i <= n; ++i) e[fail[i]].push_back(i);
        dfs(0);
        int maxn = 0;
        for(int i = 0; i < tid; ++i) maxn = max(maxn, cnt[pos[i]]);
        printf("%d\n",maxn);
        for(int i = 0; i < tid; ++i) if(maxn == cnt[pos[i]]) printf("%s\n",st[i]);
        for(int i = 0; i <= n; ++i) e[i].clear();
    }
}ac;

int main() {
    int n;
    while(scanf("%d",&n), n) {
        ac.init();
        for(int i = 0; i < n; ++i) scanf("%s",st[i]), ac.add(st[i]);
        ac.getfail();
        scanf("%s",t);
        ac.solve(t);
    }
    return 0;
}

---

二次加强版

题意

求每个模式串在文本串中出现次数

思路

还是建fail树跑一下就好。

代码

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int N = 200005;
const int M = 26;

struct ACAM {
    int nxt[N][M], fail[N], val[N], n;
    int cnt[N], pos[N], tid;
    void init() {
        memset(nxt,0,sizeof(nxt));
        memset(fail,0,sizeof(fail));
        memset(val,0,sizeof(val));
        memset(cnt,0,sizeof(cnt));
        memset(pos,0,sizeof(pos));
        n = 0;
        tid = 0;
    }
    void add(char *s) {
        int len = strlen(s), now = 0;
        for(int i = 0; i < len; ++i) {
            int tmp = s[i]-'a';
            if(!nxt[now][tmp]) nxt[now][tmp] = ++n;
            now = nxt[now][tmp];
        }
        pos[tid++] = now;
        ++val[now];
    }
    void getfail() {
        queue<int> q;
        for(int i = 0; i < 26; ++i) if(nxt[0][i]) fail[nxt[0][i]] = 0, q.push(nxt[0][i]);
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(int i = 0; i < 26; ++i) {
                if(nxt[u][i]) fail[nxt[u][i]] = nxt[fail[u]][i], q.push(nxt[u][i]);
                else nxt[u][i] = nxt[fail[u]][i];
            }
        }
    }
    vector<int> e[N];
    void buildfailtree() {
        for(int i = 1; i <= n; ++i) e[fail[i]].push_back(i);
    }
    void clearfailtree() {
        for(int i = 0; i <= n; ++i) e[i].clear();
    }
    void dfs(int u) {
        for(auto v : e[u]) {
            dfs(v);
            cnt[u] += cnt[v];
        }
    }
    void solve(char *s) {
        int len = strlen(s);
        int now = 0, ans = 0;
        for(int i = 0; i < len; ++i) {
            now = nxt[now][s[i]-'a'];
            ++cnt[now];
        }
        buildfailtree();
        dfs(0);
        for(int i = 0; i < tid; ++i) printf("%d\n",cnt[pos[i]]);
        clearfailtree();
    }
}ac;

char s[200005], t[2000005];

int main() {
    int n;
    scanf("%d",&n);
    ac.init();
    for(int i = 0; i < n; ++i) scanf("%s",s), ac.add(s);
    ac.getfail();
    scanf("%s",t);
    ac.solve(t);
    return 0;
}