UVA 1401 Remember the Word（字典树）

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68198#problem/A

 

题意：一个字符串可能有多少种给定的小串组成

 

思路：倒着递推，则有dp[i] = sum{dp[i + len(x)]}，相当于计算出从i位置到字符串终端的组合方式，故需在trie中找出单词x的前缀

 

 

#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <utility>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <climits>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment (linker, "/STACK:1024000000,1024000000")

typedef long long ll;

using namespace std;

const int mn = 400100;
const int maxn = 300010;
const int size = 26;
const int mod = 20071027;

int dp[maxn];
char s[maxn];

struct trie
{
    int ch[mn][size];
    int val[mn];
    int sz;

    void init()
    {
        sz = 1;
        memset(ch[0], 0, sizeof(ch[0]));
        memset(val, 0, sizeof(val));
    }

    int idx(char c)
    {
        return c - 'a';
    }

    void insert(char *s, int v)
    {
        int u = 0, n = strlen(s);
        for (int i = 0; i < n; i++)
        {
            int c = idx(s[i]);
            if (!ch[u][c])
            {
                memset(ch[sz], 0, sizeof(ch[sz]));
                val[sz] = 0;
                ch[u][c] = sz++;
            }
            u = ch[u][c];
        }
        val[u] = v;
    }

    void query(char *s, int v, int len)
    {
        int u = 0;
        for (int i = 0; i < len; i++)
        {
            int c = idx(s[i]);
            if (!ch[u][c]) return ;
            u = ch[u][c];
            //  printf("%d %s %d %d %d %d %d\n", i, s + i, v, len, u, c, val[u]);
            if (val[u])
            {
                //printf("%d %d %d %d %d\n", u, v, dp[v], val[u], dp[v + val[u]]);
                dp[v] = (dp[v] + dp[v + val[u]]) % mod;
            }
        }
    }
} tr;

int main()
{
    int ca = 1;
    while (~scanf("%s", s))
    {
        int n;
        char qs[120];
        scanf("%d", &n);
        int len = strlen(s);
        tr.init();
        dp[len] = 1;
        for (int i = 0; i < n; i++)
        {
            scanf("%s", qs);
            tr.insert(qs, strlen(qs));
        } 
        for (int i = len - 1; i >= 0; i--)
        {
            dp[i] = 0;
            tr.query(s + i, i, len - i);
        }
        printf("Case %d: %d\n", ca++, dp[0]);
    }
    return 0;
}