zoj 3430 Detect the Virus 【AC自动机】【坑死。。。】

Detect the Virus

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

One day, Nobita found that his computer is extremely slow. After several hours' work, he finally found that it was a virus that made his poor computer slow and the virus was activated by a misoperation of opening an attachment of an email.

Nobita did use an outstanding anti-virus software, however, for some strange reason, this software did not check email attachments. Now Nobita decide to detect viruses in emails by himself.

To detect an virus, a virus sample (several binary bytes) is needed. If these binary bytes can be found in the email attachment (binary data), then the attachment contains the virus.

Note that attachments (binary data) in emails are usually encoded in base64. To encode a binary stream in base64, first write the binary stream into bits. Then take 6 bits from the stream in turn, encode these 6 bits into a base64 character according the following table:

That is, translate every 3 bytes into 4 base64 characters. If the original binary stream contains 3k + 1 bytes, where k is an integer, fill last bits using zero when encoding and append '==' as padding. If the original binary stream contains 3k + 2 bytes, fill last bits using zero when encoding and append '=' as padding. No padding is needed when the original binary stream contains 3k bytes.

Value	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24	25	26	27	28	29	30	31
Encoding	A	B	C	D	E	F	G	H	I	J	K	L	M	N	O	P	Q	R	S	T	U	V	W	X	Y	Z	a	b	c	d	e	f
Value	32	33	34	35	36	37	38	39	40	41	42	43	44	45	46	47	48	49	50	51	52	53	54	55	56	57	58	59	60	61	62	63
Encoding	g	h	i	j	k	l	m	n	o	p	q	r	s	t	u	v	w	x	y	z	0	1	2	3	4	5	6	7	8	9	+	/

For example, to encode 'hello' into base64, first write 'hello' as binary bits, that is: 01101000 01100101 01101100 01101100 01101111
Then, take 6 bits in turn and fill last bits as zero as padding (zero padding bits are marked in bold): 011010 000110 010101 101100 011011 000110 111100
They are 26 6 21 44 27 6 60 in decimal. Look up the table above and use corresponding characters: aGVsbG8
Since original binary data contains 1 * 3 + 2 bytes, padding is needed, append '=' and 'hello' is finally encoded in base64: aGVsbG8=

Section 5.2 of RFC 1521 describes how to encode a binary stream in base64 much more detailedly:

Click here to see Section 5.2 of RFC 1521 if you have interest

Here is a piece of ANSI C code that can encode binary data in base64. It contains a function, encode (infile, outfile), to encode binary file infile in base64 and output result to outfile.

Click here to see the reference C code if you have interest

Input

Input contains multiple cases (about 15, of which most are small ones). The first line of each case contains an integer N (0 <= N <= 512). In the next N distinct lines, each line contains a sample of a kind of virus, which is not empty, has not more than 64 bytes in binary and is encoded in base64. Then, the next line contains an integer M (1 <= M <= 128). In the following M lines, each line contains the content of a file to be detected, which is not empty, has no more than 2048 bytes in binary and is encoded in base64.

There is a blank line after each case.

Output

For each case, output M lines. The i^th line contains the number of kinds of virus detected in the i^th file.

Output a blank line after each case.

Sample Input

3
YmFzZTY0
dmlydXM=
dDog
1
dGVzdDogdmlydXMu

1
QA==
2
QA==
ICAgICAgICA=

Sample Output

2

1
0

Hint

In the first sample case, there are three virus samples: base64, virus and t: , the data to be checked is test: virus., which contains the second and the third, two virus samples.

原串s1——根据每个字符的ascll码写出所有8位二进制，然后每6位分割一次，根据分割出的二进制化成十进制，在表中找到对应的字符，得到base64串s2。若原串s1占字节为3*k+1，在s2后面添上两个=；若原串s1占字节为3*k+2，在s2后面添上一个=；若原串s1占字节为3*k，不进行任何添加操作。

题意：给你n个base64目标串和m个文本串，问你文本串中出现多少种目标串？

用字符串WA到死，ORZ下bin神，o(╯□╰)o太渣了。

思路：将base64字符串解码成原串，解码坑死我了。然后跑AC自动机，把存在串的编号标记上，最后统计出所有标记的串数。 

AC代码：

#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <algorithm>
#define MAXN 60000+10
using namespace std;
struct Trie
{
    int next[MAXN][256], fail[MAXN], End[MAXN];
    int L, root;
    int newnode()
    {
        for(int i = 0; i < 256; i++)//256个分支。。。
            next[L][i] = -1;
        End[L++] = -1;
        return L-1;
    }
    void init()
    {
        L = 0;
        root = newnode();
    }
    void Insert(unsigned char *s, int len, int id)
    {
        int now = root;
        for(int i = 0; i < len; i++)
        {
            if(next[now][s[i]] == -1)
                next[now][s[i]] = newnode();
            now = next[now][s[i]];
        }
        End[now] = id;
    }
    void Build()
    {
        queue<int> Q;
        fail[root] = root;
        for(int i = 0; i < 256; i++)
        {
            if(next[root][i] == -1)
                next[root][i] = root;
            else
            {
                fail[next[root][i]] = root;
                Q.push(next[root][i]);
            }
        }
        while(!Q.empty())
        {
            int now = Q.front();
            Q.pop();
            for(int i = 0; i < 256; i++)
            {
                if(next[now][i] == -1)
                    next[now][i] = next[fail[now]][i];
                else
                {
                    fail[next[now][i]] = next[fail[now]][i];
                    Q.push(next[now][i]);
                }
            }
        }
    }
    bool flag[600];
    int Query(unsigned char *s, int len, int n)
    {
        int now = root;
        int ans = 0;
        memset(flag, false, sizeof(flag));
        for(int i = 0; i < len; i++)
        {
            now = next[now][s[i]];
            int temp = now;
            while(temp != root)
            {
                if(End[temp] != -1)
                    flag[End[temp]] = true;
                temp = fail[temp];
            }
        }
        for(int i = 1; i <= n; i++)
            ans += flag[i] ? 1 : 0;
        return ans;
    }
};
Trie ac;
unsigned char buf[2050];
int top;
char str[4000];
unsigned char s[4000];
unsigned char Get(char ch)
{
    if(ch >= 'A' && ch <= 'Z')
        return ch - 'A';
    else if(ch >= 'a' && ch <= 'z')
        return ch - 'a' + 26;
    else if(ch >= '0' && ch <= '9')
        return ch - '0' + 52;
    else if(ch == '+')
        return 62;
    else
        return 63;
}
void change(unsigned char str[],int len)
{
    int t = 0;
    for(int i = 0; i < len; i += 4)
    {
        buf[t++] = (str[i]<<2) | (str[i+1]>>4);
        if(i+2 < len)
            buf[t++] = (str[i+1]<<4) | (str[i+2]>>2);
        if(i+3 < len)
            buf[t++] = (str[i+2]<<6) | str[i+3];
    }
    top = t;
}
int main()
{
    int n, m;
    while(scanf("%d",&n) == 1)
    {
        ac.init();
        for(int i = 1; i <= n; i++)
        {
            scanf("%s", str);
            int len = strlen(str);
            while(str[len-1] == '=')
                len--;
            for(int j = 0; j < len; j++)
                s[j] = Get(str[j]);
            change(s, len);
            ac.Insert(buf, top, i);
        }
        ac.Build();
        scanf("%d", &m);
        while(m--)
        {
            scanf("%s", str);
            int len = strlen(str);
            while(str[len-1] == '=')
                len--;
            for(int j = 0; j < len; j++)
                s[j] = Get(str[j]);
            change(s, len);
            printf("%d\n",ac.Query(buf, top, n));
        }
        printf("\n");
    }
    return 0;
}