UVaLive/LA 6806 Hari Merdeka（AC自动机，DP）

// Author: Yuan Zhu
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#define maxn 20010
#define ll long long
using namespace std;

int t;
int N, M, B;
int v[30], c[210];
int next[maxn][26], fail[maxn];
int L, rt, end[maxn];
char C[30];

inline int newnode() {
    memset(next[L], 0, sizeof next[L]);
    end[L++] = 0;
    return L - 1;
}

inline void init() {
    L = 0;
    rt = newnode();
}

inline void insert(char *s, int z) {
    int l = strlen(s), x = rt;
    for (int i = 0; i < l; i++) {
        int z = s[i] - 'A';
        if(!next[x][z]) next[x][z] = newnode();
        x = next[x][z];
    }
    end[x] = z;
}

inline void build() {
    queue<int> q;
    fail[0] = 0;
    for (int i = 0; i < 26; i++) {
        if (next[rt][i] != 0) {
            fail[next[rt][i]] = rt;
            q.push(next[rt][i]);
        }
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int i = 0; i < 26; i++) {
            if (next[x][i] == 0) {
                next[x][i] = next[fail[x]][i];
            } else {
                fail[next[x][i]] = next[fail[x]][i];
                q.push(next[x][i]);
            }
        }
    }
}

void read() {
    scanf("%d%d%d", &N, &M, &B);
    int value;
    for (int i = 0; i < N; i++) {
        scanf("\n%c %d", &c[i], &value);
        v[i] = value;
    }
    char s[110];
    for (int i = 0; i < M; i++) {
        scanf("%s%d", s, &value);
        insert(s, value);
    }
}

ll dp[210][maxn], cost[maxn];

void work(int ca) {
    memset(dp, -1, sizeof dp);
    dp[0][0] = 0;
    ll ans = 0;
    for (int i = 1; i < L; i++) {
        cost[i] = 0;
        int x = i;
        while (x) {
            cost[i] += end[x];
            x = fail[x];
        }
        //cout<<i<<" "<<cost[i]<<endl;
    }
    for (int i = 0; i <= B; i++) {
        for (int j = 0; j < L; j++) {
            if (dp[i][j] == -1) continue;
            for (int k = 0; k < N; k++) {
                if (i + v[k] > B) continue;
                int nxt = next[j][c[k] - 'A'];
                dp[i + v[k]][nxt] = max(dp[i + v[k]][nxt], dp[i][j] + cost[nxt]);
                //cout<<i+v[k]<<" "<<nxt<<" "<<dp[i+v[k]][nxt]<<endl;
            }
        }
    }
    for (int i = 0; i <= B; i++) {
        for (int j = 0; j < L; j++) {
            ans = max(ans, dp[i][j]);
        }
    }
    printf("Case #%d: %lld\n", ca, ans);
}

int main() {
    scanf("%d", &t);
    for (int ca = 1; ca <= t; ca++) {
        init();
        read();
        build();
        work(ca);
    }
    return 0;
}