http://acm.hdu.edu.cn/showproblem.php?pid=2896
问你目标串中出现了几个模式串
同上一题,只是这题要输出模式串的ID,且字符是所有可见字符,要开[128]的儿子结点. set记录每个网址包含的病毒的编号。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
#include <string>
#include <set>
#include <functional>
#include <numeric>
#include <sstream>
#include <stack>
#include <map>
#include <queue>
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define ll long long
#define inf 0x7f7f7f7f
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)
#define L(x) (x) << 1
#define R(x) (x) << 1 | 1
#define MID(l, r) (l + r) >> 1
#define Min(x, y) (x) < (y) ? (x) : (y)
#define Max(x, y) (x) < (y) ? (y) : (x)
#define E(x) (1 << (x))
#define iabs(x) (x) < 0 ? -(x) : (x)
#define OUT(x) printf("%I64d\n", x)
#define lowbit(x) (x)&(-x)
#define Read() freopen("din.txt", "r", stdin)
#define Write() freopen("dout.txt", "w", stdout);
#define Nn 100007
#define Mc 95
using namespace std;
set<int>iset;
class Acautomaton
{
private:
int chd[Nn][Mc];
int fail[Nn];
int val[Nn];
int ID[Mc];
int Q[Nn];
int sz;
public :
void Init()
{
fail[0] = 0;
}
void Reset()
{
CL(chd[0],0);
sz = 1;
}
void Insert(char *s,int key)
{
int k;
int p = 0;
for (; *s; s++)
{
k = *s - 32;
// printf("%d\n",k);
if (!chd[p][k])
{
CL(chd[sz],0);
val[sz] = 0;
chd[p][k] = sz++;
}
p = chd[p][k];
}
val[p] = key;
}
void Build()
{
int *s = Q, *e = Q;
int i;
for (i = 0; i < Mc; ++i)
{
if (chd[0][i])
{
fail[chd[0][i]] = 0;
*e++ = chd[0][i];
}
}
while (s != e)
{
// printf(">>>\n");
int u = *s++;
for (i = 0; i < Mc; ++i)
{
int &v = chd[u][i];
if (v)
{
*e++ = v;
fail[v] = chd[fail[u]][i];
val[v] |= val[fail[v]];
}
else v = chd[fail[u]][i];
}
}
}
void solve(char *s)
{
int k;
iset.clear();
int p = 0;
for (; *s; s++)
{
k = *s - 32;
while (!chd[p][k] && p != 0) p = fail[p];
p = chd[p][k];
int rt = p;
while (rt != 0&&val[rt] != 0)
{
iset.insert(val[rt]);
rt = fail[rt];
}
}
}
}ac;
int n,m;
char s1[201], s2[10007];
int main()
{
// printf("%d\n",'z');
// Read();
int i;
set<int>::iterator it;
while (~scanf("%d",&n))
{
ac.Reset(); ac.Init();
for (i = 0; i < n; ++i)
{
scanf("%s",s1);
ac.Insert(s1,i + 1);
}
ac.Build();
int total = 0;
scanf("%d",&m);
for (i = 0; i < m; ++i)
{
scanf("%s",s2);
ac.solve(s2);
if (iset.size() != 0)
{
total++;
printf("web %d:",i + 1);
for (it = iset.begin(); it != iset.end(); ++it)
{
printf(" %d",*it);
}
printf("\n");
}
}
printf("total: %d\n",total);
}
return 0;
}