LA4670 Dominating Patterns AC自动机模板

Dominating Patterns

 

每次看着别人的代码改成自己的模板都很头大。。。空间少了个0卡了好久

裸题，用比map + string更高效的vector代替蓝书中的处理方法

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath> 
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define abs(a) ((a) < 0 ? (-1 * (a)) : (a))
inline void swap(int &a, int &b)
{
    long long tmp = a;a = b;b = tmp;
}
inline void read(int &x)
{
    x = 0;char ch = getchar(), c = ch;
    while(ch < '0' || ch > '9') c = ch, ch = getchar();
    while(ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar();
    if(c == '-') x = -x;
}

const int INF = 0x3f3f3f3f;
const int MAXNODE = 150 * 70 * 10;

int ch[MAXNODE][30], last[MAXNODE], root = 0, tag[MAXNODE], fail[MAXNODE], cnt, tot[MAXNODE];
std::vector<int> node[MAXNODE];
char s[1600][800];

void insert(int x)
{
    int now = root;
    for(int i = 1;s[x][i] != '';++ i)
    {
        int& tmp = ch[now][s[x][i] - 'a' + 1];
        if(tmp) now = tmp;
        else now = tmp = ++ cnt; 
    }
    ++ tag[now];
    node[now].push_back(x);
}

int q[MAXNODE], he, ta, ma;
void build()
{
    he = 0, ta = 0;
    
    for(register int i = 1;i <= 26;++ i)
    {
        int u = ch[root][i];
        if(u) q[ta ++] = u, fail[u] = last[u] = 0;
    } 
    
    while(he < ta)
    {
        int now = q[he ++];
        for(register int i = 1;i <= 26;++ i)
        {
            int u = ch[now][i];
            if(!u) 
            {
                ch[now][i] = ch[fail[now]][i];
                continue;
            }
            q[ta ++] = u;
            int v = fail[now];
            while(v && !ch[v][i]) v = fail[v];
            fail[u] = ch[v][i];
            last[u] = tag[fail[u]] ? fail[u] : last[fail[u]];
        }
    }
}


int n;
char T[1100000];

void find()
{
    int n = strlen(T + 1);
    int j = root;
    for(register int i = 1;i <= n;++ i)
    {
        int c = T[i] - 'a' + 1;
        j = ch[j][c];
        if(tag[j])    for(int k = 0;k < node[j].size();++ k) ++ tot[node[j][k]], ma = max(ma, tot[node[j][k]]);
        else if(last[j]) for(int k = 0;k < node[last[j]].size();++ k) ++ tot[node[last[j]][k]], ma = max(ma, tot[node[last[j]][k]]);
    }
}

int main()
{
    while(scanf("%d", &n) != EOF && n)
    {
        ma = 0, memset(tot, 0, sizeof(tot)), memset(ch, 0, sizeof(ch)), memset(tag, 0, sizeof(tag));
        for(register int i = 1;i <= cnt;++ i) node[i].clear();
        cnt = 1;
        for(register int i = 1;i <= n;++ i)
        {
            scanf("%s", s[i] + 1);
            insert(i);
        }
        build();
        scanf("%s", T + 1);
        find();
        printf("%d
", ma);
        for(register int i = 1;i <= n;++ i)
            if(tot[i] == ma) printf("%s
", s[i] + 1);
    }
    return 0;
}