A题 AC自动机+状压dp

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#define inf 102333
#define rep(i,j,k) for(register int i = j; i <= k; i++)
#define low(i,j,k) for(register int i = j; i <= k; i++)
#define maxn 105
using namespace std;

inline int read(){
    int s = 0, t = 1; char c = getchar();
    while( !isdigit(c) ) { if( c == '-' ) t = -1; c = getchar(); }
    while( isdigit(c) ) s = s * 10 + c - 48, c = getchar();
    return s * t;
}

int ch[maxn*20][4], f[maxn*20], last[maxn*20], val[maxn*20], n, l;
int dp[2][1024][1023], key[12], value[523]; 
char c[105];

int idx(char c) { if( c == 'A' ) return 0; if( c == 'T' ) return 1; if( c == 'C' ) return 2; if( c == 'G' ) return 3; }

int sz;
void clear() { sz = 0; val[sz] = 0; f[sz] = 0, last[sz] = 0; memset(ch[0],0,sizeof(ch[0])); memset(dp,0,sizeof(dp)); }
void insert(char *c, int now){
    int s = strlen(c), p = 0;
    rep(i,0,s-1){
        int t = idx(c[i]); if( !ch[p][t] ) { ch[p][t] = ++sz; memset(ch[sz],0,sizeof(ch[sz])); val[sz] = 0; f[sz] = 0, last[sz] = 0; }
        p = ch[p][t];
    }
    val[p] |= now;
}

void get_fail() {
    queue<int> q;
    rep(i,0,3) { int u = ch[0][i]; if( u ) q.push(u); }
    while( !q.empty() ){
        int r = q.front(); q.pop();
        rep(i,0,3){
            int u = ch[r][i]; if( !u ) { ch[r][i] = ch[f[r]][i]; continue; } q.push(u);
            int v = f[r]; while( v && !ch[v][i] ) v = f[v]; f[u] = ch[v][i];
            last[u] = val[f[u]] ? f[u] : last[f[u]]; val[u] |= val[last[u]]; 
        }
    }
}

inline int getkey(int b){
    int ret = 0;
    rep(i,1,n) if( b & key[i] ) ret += value[key[i]]; 
    return ret;
}

int main() {
    key[1] = 1; rep(i,2,11) key[i] = key[i-1] * 2;
    while( scanf("%d %d", &n,&l) == 2 ) {
        clear(); 
        rep(i,1,n) { scanf("%s", c); value[key[i]] = read();  insert(c,key[i]); } get_fail();
        //rep(i,0,sz) cout<<i<<" "<<val[i]<<" "<<f[i]<<endl;  cout<<endl;
        int now = 0, pre = 1; dp[now][0][0] = 1;
        rep(i,0,l-1){
            swap(now,pre);
            rep(j,0,key[n+1]-1)
                rep(k,0,sz){
                    if( !dp[pre][j][k] ) continue; //cout<<i<<" "<<j<<" "<<k<<" "<<getkey(j)<<endl;
                    rep(l,0,3){ int to = j | val[ch[k][l]]; dp[now][to][ch[k][l]] = 1; }//cout<<i+1<<" "<<to<<" "<<ch[k][l]<<" "<<getkey(to)<<endl;  }
                    dp[pre][j][k] = 0; 
                }
        }
        int ans = -1;
        rep(j,0,key[n+1]-1){
            if( ans >= getkey(j) ) continue;
            rep(k,0,sz){
                if( !dp[now][j][k] ) continue;
                ans = max(ans,getkey(j)); break;
            }
        }
        if( ans >= 0 ) printf("%d
", ans);
        else printf("No Rabbit after 2012!
");
    }
    return 0;
}