AC自动机指针版本和数组版本

来源：互联网发布：java ee基础实用教程编辑：程序博客网时间：2024/05/22 03:16

#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;#define N 100003struct Tr{    int cnt;    Tr *ne[26];    Tr *fail;    Tr() {        cnt = 0;        for (int i = 0;i < 26;i++) ne[i] = NULL;        fail = NULL;    }    void init() {        cnt = 0;        for (int i = 0;i < 26;i++) ne[i] = NULL;        fail = NULL;    }}root, tr[N];int tot;void Insert(char *s) {    Tr *p = &root;    int endId = 0;    while (s[endId]) {        int id = s[endId]-'a';        if (p->ne[id] == NULL) {            p->ne[id] = &tr[++tot];            tr[tot].init();        }        p = p->ne[id];        endId++;    }    p->cnt++;}int query(char *s) {    int i, j, re = 0;    Tr *p = &root;    for (i = 0;s[i];i++) {        int id = s[i]-'a';        while (p->ne[id] == NULL && p != (&root)) p = p->fail;        p = p->ne[id];        if (p == NULL) p = &root;        Tr *tmp = p;        while (tmp != (&root) && tmp->cnt != -1) {            re += tmp->cnt;            tmp->cnt = -1;            tmp = tmp->fail;        }    }    return re;}char s[N], t[N];Tr* Q[N];void build() {    Tr *p = &root;    root.fail = NULL;    int f = 0, r = 1;    Q[f] = p;    while (f < r) {        p = Q[f++];        for (int i = 0;i < 26;i++) {            if (p->ne[i]) {                if (p == (&root)) p->ne[i]->fail = &root;                else {                    Tr *tmp = p->fail;                    while (tmp != NULL) {                        if (tmp->ne[i]) {                            p->ne[i]->fail = tmp->ne[i];                            break;                        }                        tmp = tmp->fail;                    }                    if (tmp == NULL) p->ne[i]->fail = &root;                }                Q[r++] = p->ne[i];            }        }    }}int main() {    int T, n, i, j;    scanf("%d", &T);    while (T--) {        tot = 0;        root.init();        scanf("%d", &n);        getchar();        int mxlen = 0;        for (i = 0;i < n;i++) {            gets(s);            int len = strlen(s);            if (mxlen < len) {                mxlen = len;                strcpy(t, s);            }            Insert(s);        }        build();        if (query(t) == n) {            puts(t);        }else puts("No");    }}

#include<cstdio>#include<cstring>#include<queue>using namespace std;#define N 100003struct Tr{    int tr[N][26], cnt[N], fail[N];    int root, tot;    int newTr() {        int i, d = ++tot;        for (i = 0;i < 26;i++) tr[d][i] = 0;        fail[d] = cnt[d] = 0;        return d;    }    void init() {        tot = 0;        root = newTr();    }    void Insert(char *s) {        int d = root;        for (int i = 0;s[i];i++) {            int id = s[i]-'a';            if (tr[d][id] == 0) tr[d][id] = newTr();            d = tr[d][id];        }        cnt[d]++;    }    void build() {        queue<int> Q;        Q.push(root);        while (!Q.empty()) {            int d = Q.front();            Q.pop();            for (int i = 0;i < 26;i++) {                if (tr[d][i]) {                    if (d == root) {                        fail[tr[d][i]] = root;                    }else {                        int tmp = fail[d];                        while (tmp) {                            if (tr[tmp][i]) {                                fail[tr[d][i]] = tr[tmp][i];                                break;                            }                            tmp = fail[tmp];                        }                        if (tmp == 0) fail[tr[d][i]] = root;                    }                    Q.push(tr[d][i]);                }            }        }    }    int query(char *s) {        int d = root, i, re = 0;        for (i = 0;s[i];i++) {            int id = s[i]-'a';            while (d != root && tr[d][id] == 0) d = fail[d];            d = tr[d][id];            if (d == 0) d = root;            int tmp = d;            while (tmp != root && cnt[tmp] != -1) {                re += cnt[tmp];                cnt[tmp] = -1;                tmp = fail[tmp];            }        }        return re;    }}ans;char s[N], t[N];int main() {    int T, n, i, j;    scanf("%d", &T);    while (T--) {        ans.init();        scanf("%d", &n);        getchar();        int mxlen = 0;        for (i = 0;i < n;i++) {            gets(s);            int len = strlen(s);            if (mxlen < len) {                mxlen = len;                strcpy(t, s);            }            ans.Insert(s);        }        ans.build();        if (ans.query(t) == n) {            puts(t);        }else puts("No");    }}

阅读全文

0 0