ZOJ-3430 Detect the Virus（解码后最好用整数存）

题意：给出n个模式串，先将其解码；再给出m个主串，判断每个主串中出现了几个模式串（判断每个模式串是否出现过）。

WA1：没注意到解码后字符范围0~255；
WAWAWAWA…：参考别人的解码后存字符，WA了很多次，后将解码存为int就过了

丑の代码：

#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int N = 5e4 + 5;
int trie[N][260]; 
int cntword[N]; 
int fail[N]; 
int tot = 0, flag[N];
char s[N];
int buf[N];
void insertWords(int *s, int l){
    int root = 0;
    for(int i = 0; i < l; ++i){
        int next = s[i];
        if(!trie[root][next])
            trie[root][next] = ++tot;
        root = trie[root][next];
    }
    ++cntword[root];
}
void getFail(){
    queue<int> q;
    for(int i = 0; i < 260; ++i){  
        if(trie[0][i]){
            fail[trie[0][i]] = 0;
            q.push(trie[0][i]);
        }
    }
    while(!q.empty()){
        int now = q.front();
        q.pop();

        for(int i = 0; i < 260; ++i){ 
            if(trie[now][i]){
                fail[trie[now][i]] = trie[fail[now]][i];
                q.push(trie[now][i]);
            }
            else
                trie[now][i] = trie[fail[now]][i];
        }
    }
}


int query(int *s, int l){
    int now = 0,ans = 0;
    for(int i = 0; i < l; ++i){   
        now = trie[now][s[i]];
        for(int j = now; j && cntword[j] != -1 && !flag[j]; j = fail[j]){
            flag[j] = 1;
            ans += cntword[j];
        }
    }
    return ans;
}

void init(){
	memset(cntword, 0, sizeof(cntword));
	memset(trie, 0, sizeof(trie));
	tot = 0;
}

char get(char ch){
    if( ch >= 'A' && ch <= 'Z' )return ch - 'A';
    if( ch >= 'a' && ch <= 'z' )return ch - 'a' + 26;
    if( ch >= '0' && ch <= '9' )return ch - '0' + 52;
    if( ch == '+' )return 62;
    else return 63;
}

int change(char *a){   
    int l = 0;
    for(int i = 0, len = 0, x = 0; a[i] && a[i] != '='; ++i){  
        len += 6,x = (x << 6) | get(a[i]);  
        if(len >= 8){  
            buf[l]=(x >> (len - 8)) & 0xff;
            len -= 8; 
			++l;  
        }  
    } 
	return l; 
} 

int main()
{
	int n;
	while(scanf("%d", &n) != EOF){
	    for(int i = 0; i < n; ++i){
	        scanf("%s", s);
	        int l = change(s);
	        insertWords(buf, l);
	        //printf("%s\n", buf);
	    }
	    fail[0] = 0;
	    getFail();
	    scanf("%d", &n);
	    for(int i = 0; i < n; ++i){
	    	scanf("%s", s);
	        int l = change(s);
	        //printf("%s\n", buf);
	    	printf("%d\n", query(buf, l));
			memset(flag, 0, sizeof(flag));
	    }
	    init();
	    printf("\n");
	}
    return 0;
}