HDU 4057 Rescue the Rabbit(AC自动机+DP)

题目链接

一个数组开小了一点点，一直提示wa，郁闷，这题比上个题简单一点。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstdlib>
using namespace std;
#define N 1001
#define INF 1000000
int trie[N][5];
int que[N];
int o[1<<10];
int flag[N];
int fail[N];
int dp1[N][1<<10];
int dp2[N][1<<10];
int t,n;
int lowbit(int t)
{
    return t&(-t);
}
void CL()
{
    t = 1;
    memset(trie,-1,sizeof(trie));
    memset(o,0,sizeof(o));
    memset(flag,0,sizeof(flag));
}
int judge(char s)
{
    switch(s)
    {
    case'A':
        return 0;
    case'C':
        return 1;
    case'G':
        return 2;
    case'T':
        return 3;
    }
    return 0;
}
void insert(char *str,int x,int j)
{
    int i,len,root;
    root = 0;
    len = strlen(str);
    for(i = 0; i < len; i ++)
    {
        if(trie[root][judge(str[i])] == -1)
            trie[root][judge(str[i])] = t ++;
        root = trie[root][judge(str[i])];
    }
    flag[root] = 1<<j;
}
void build_ac()
{
    int head,tail,front,i;
    head = tail = 0;
    for(i = 0; i < 4; i ++)
    {
        if(trie[0][i] != -1)
        {
            fail[trie[0][i]] = 0;
            que[tail++] = trie[0][i];
        }
        else
        {
            trie[0][i] = 0;
        }
    }
    while(head != tail)
    {
        front = que[head++];
        flag[front] |= flag[fail[front]];
        for(i = 0; i < 4; i ++)
        {
            if(trie[front][i] != -1)
            {
                que[tail++] = trie[front][i];
                fail[trie[front][i]] = trie[fail[front]][i];
            }
            else
            {
                trie[front][i] = trie[fail[front]][i];
            }
        }
    }
}
int main()
{
    int m,i,j,u,x,len,k;
    int sc[101];
    char str[1001];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        CL();
        for(i = 0; i < n; i ++)
        {
            scanf("%s%d",str,&x);
            len = strlen(str);
            if(len > m)
            {
                i --;
                n -- ;
                continue;
            }
            sc[i] = x;
            insert(str,x,i);
        }
        for(i = 0;i < n;i ++)
        o[1<<i] = sc[i];
        for(i = 1; i < 1<<n;i ++)
        {
            o[i] = o[i-lowbit(i)] + o[lowbit(i)];
        }
        build_ac();
        for(j = 0; j < t; j ++)
        {
            for(k = 0; k < (1<<n); k ++)
            {
                dp1[j][k] = 0;
                dp2[j][k] = 0;
            }
        }
        dp1[0][0] = 1;
        for(i = 0; i < m; i ++)
        {
            for(j = 0; j < t; j ++)
            {
                for(k = 0;k < (1<<n);k ++)
                {
                    if(dp1[j][k] == 0) continue;
                    int temp;
                    for(u = 0;u < 4;u ++)
                    {
                        temp = k|flag[trie[j][u]];
                        dp2[trie[j][u]][temp] += dp1[j][k];
                    }
                }
            }
            for(j = 0; j < t; j ++)
            {
                for(k = 0; k < (1<<n); k ++)
                {
                    dp1[j][k] = dp2[j][k];
                    dp2[j][k] = 0;
                }
            }
        }
        int ans = -INF;
        for(j = 0;j < t;j ++)
        {
            for(k = 0;k <(1<<n);k ++)
            {
                if(dp1[j][k])
                ans = max(ans,o[k]);
            }
        }
        if(ans >= 0)
        printf("%d
",ans);
        else
        printf("No Rabbit after 2012!
");
    }
    return 0;
}