HDU 3341 Lost's revenge

Lost's revenge

Time Limit: 5000ms

Memory Limit: 65535KB

This problem will be judged on HDU. Original ID: 3341
64-bit integer IO format: %I64d      Java class name: Main

Lost and AekdyCoin are friends. They always play "number game"(A boring game based on number theory) together. We all know that AekdyCoin is the man called "nuclear weapon of FZU,descendant of Jingrun", because of his talent in the field of number theory. So Lost had never won the game. He was so ashamed and angry, but he didn't know how to improve his level of number theory.

One noon, when Lost was lying on the bed, the Spring Brother poster on the wall(Lost is a believer of Spring Brother) said hello to him! Spring Brother said, "I'm Spring Brother, and I saw AekdyCoin shames you again and again. I can't bear my believers were being bullied. Now, I give you a chance to rearrange your gene sequences to defeat AekdyCoin!".

It's soooo crazy and unbelievable to rearrange the gene sequences, but Lost has no choice. He knows some genes called "number theory gene" will affect one "level of number theory". And two of the same kind of gene in different position in the gene sequences will affect two "level of number theory", even though they overlap each other. There is nothing but revenge in his mind. So he needs you help to calculate the most "level of number theory" after rearrangement.

 

Input

There are less than 30 testcases.
For each testcase, first line is number of "number theory gene" N(1<=N<=50). N=0 denotes the end of the input file.
Next N lines means the "number theory gene", and the length of every "number theory gene" is no more than 10.
The last line is Lost's gene sequences, its length is also less or equal 40.
All genes and gene sequences are only contains capital letter ACGT.

 

Output

For each testcase, output the case number(start with 1) and the most "level of number theory" with format like the sample output.

 

Sample Input

3
AC
CG
GT
CGAT
1
AA
AAA
0

Sample Output

Case 1: 3
Case 2: 2

Source

HDOJ Monthly Contest – 2010.03.06

 

解题：Trie 图 + 变进制hash + 状压dp

#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
struct Trie {
    int ch[maxn][4],fail[maxn],cnt[maxn],tot;
    int id[256];
    void init() {
        tot = 0;
        newnode();
        for(int i = 0; i < 4; ++i) id["ACGT"[i]] = i;
    }
    int newnode() {
        memset(ch[tot],0,sizeof ch[tot]);
        fail[tot] = cnt[tot] = 0;
        return tot++;
    }
    void insert(char *str,int rt = 0) {
        for(int i = 0; str[i]; ++i) {
            int &x = ch[rt][id[str[i]]];
            if(!x) x = newnode();
            rt = x;
        }
        cnt[rt]++;
    }
    void build(int rt = 0) {
        queue<int>q;
        for(int i = 0; i < 4; ++i)
            if(ch[rt][i]) q.push(ch[rt][i]);
        while(!q.empty()) {
            rt = q.front();
            q.pop();
            cnt[rt] += cnt[fail[rt]];
            for(int i = 0; i < 4; ++i) {
                int &x = ch[rt][i],y = ch[fail[rt]][i];
                if(x) {
                    fail[x] = y;
                    q.push(x);
                } else x = y;
            }
        }
    }
    int dp[maxn][11*11*11*11 + 5];
    int solve(char *str) {
        int bt[4] = {0,0,0,1},num[4] = {};
        for(int i = 0; str[i]; ++i) ++num[id[str[i]]];
        for(int i = 2; i >= 0; --i)
            bt[i] = bt[i + 1]*(num[i] + 1);
        memset(dp,-1,sizeof dp);
        int ans = dp[0][0] = 0;
        for(int a = 0; a <= num[0]; ++a)
            for(int b = 0; b <= num[1]; ++b)
                for(int c = 0; c <= num[2]; ++c)
                    for(int d = 0; d <= num[3]; ++d) {
                        int hs = a*bt[0] + b*bt[1] + c*bt[2] + d;
                        for(int i = 0; i < tot; ++i) {
                            if(dp[i][hs] == -1) continue;
                            for(int k = 0; k < 4; ++k) {
                                if(a == num[0] && k == 0) continue;
                                if(b == num[1] && k == 1) continue;
                                if(c == num[2] && k == 2) continue;
                                if(d == num[3] && k == 3) continue;
                                int x = dp[ch[i][k]][hs + bt[k]];
                                int y = dp[i][hs] + cnt[ch[i][k]];
                                dp[ch[i][k]][hs + bt[k]] = max(x,y);
                            }
                        }
                    }
        int st = num[0]*bt[0] + num[1]*bt[1] + num[2]*bt[2] + num[3]*bt[3];
        for(int i = 0; i < tot; ++i)
            ans = max(ans,dp[i][st]);
        return ans;
    }
} ac;
char str[maxn];
int main() {
    int n,cs = 1;
    while(scanf("%d",&n),n){
        ac.init();
        while(n--){
            scanf("%s",str);
            ac.insert(str);
        }
        scanf("%s",str);
        ac.build();
        printf("Case %d: %d
",cs++,ac.solve(str));
    }
    return 0;
}