UVa 1449 Dominating Patterns

方法：AC自动机

题意比较明显，用ac 自动机。陷阱是可能会出现重复的string。

code:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <fstream>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <sstream>
#include <time.h>
#include <complex>
#include <iomanip>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define FOR(a,b,c) for (ll (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (ll (a)=(b);(a)<=(c);++(a))
#define DFOR(a,b,c) for (ll (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (ll (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define rep(i,n) FOR(i,0,n)
#define repn(i,n) FORN(i,1,n)
#define drep(i,n) DFOR(i,n-1,0)
#define drepn(i,n) DFOR(i,n,1)
#define MAX(a,b) a = Max(a,b)
#define MIN(a,b) a = Min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define Reset(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(all(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define forever for(;;)
#define PINF 1000000000000
#define newline '
'

#define test if(1)if(0)cerr
using namespace std;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
typedef pair<char,char> cc;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l4;
const double pi = acos(-1.0);


const int MAXNODE = 11000+5;
const int SIGMA_SIZE = 26;


int n;
string text, input[151];
map<string, int> ms;


inline int idx(char c) { return c-'a'; }
int cnt[151];
struct AC
{
    int g[MAXNODE][SIGMA_SIZE], f[MAXNODE], val[MAXNODE], last[MAXNODE];
    int sz;
    int newnode()
    {
        memset(g[sz], 0, sizeof(g[sz]));
        val[sz] = 0;
        return sz++;
    }
    void init()
    {
        sz = 0; newnode();
    }
    void insert(const string &str, int v)
    {
        int u = 0, n = str.length();
        for (int i = 0; i < n; ++i)
        {
            int c = idx(str[i]);
            if (!g[u][c]) g[u][c] = newnode();
            u = g[u][c];
        }
        val[u] = v;
    }
    void print(int j)
    {
        if (j)
        {
            ++cnt[val[j]];

            // operation
            print(last[j]);
        }
    }
    void find(const string &str)
    {
        int n = str.length(), j = 0;
        for (int i = 0; i < n; ++i)
        {
            int c = idx(str[i]);
            j = g[j][c];

            if (val[j]) print(j);
            else if (last[j]) print(last[j]);
        }
    }
    void get_fail()
    {
        queue<int> q; f[0] = 0; last[0] = 0;
        for (int c = 0; c < SIGMA_SIZE; ++c)
        {
            int u = g[0][c];
            if (u) { f[u] = 0; q.push(u); last[u] = 0; }
        }
        while (!q.empty())
        {
            int r = q.front();  q.pop();
            for (int c = 0; c < SIGMA_SIZE; ++c)
            {
                int u = g[r][c];
                if (!u) { g[r][c] = g[f[r]][c]; continue; }
                q.push(u);
                int v = f[r];
                while (v && !g[v][c]) v = f[v];
                f[u] = g[v][c];
                last[u] = val[f[u]]?f[u]:last[f[u]];
            }
        }
    }
    
};

AC ac;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    while (cin >> n && n)
    {
        ms.clear();
        Reset(cnt, 0);
        ac.init();
        repn(i, n)
        {
            cin >> input[i];
            ms[input[i]] = i;
        }
        cin >> text;
        for (auto &pr : ms)
        {
            ac.insert(pr.first, pr.second);
        }
        ac.get_fail();
        ac.find(text);
        int best = 0;
        for (int i = 1; i <= n; ++i) best = max(best, cnt[i]);
        cout << best << newline;
        for (int i = 1; i <= n; ++i)
            if (cnt[ms[input[i]]] == best)
                cout << input[i] << newline;
    }
}