【POJ】3283 Card Hands

字典树。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <stack>
using namespace std;

#define TRIEN 56

typedef struct Trie {
    Trie *next[TRIEN];
    Trie() {
        for (int i=0; i<TRIEN; ++i)
            next[i] = NULL;
    }
} Trie;

Trie *root;
int nn;

Trie *create(const char str[], Trie *r) {
    int i = 0, id;
    Trie *p = r, *q;

    if (str[i] == 'A')
        id = 1;
    else if (str[i] == 'J')
        id = 11;
    else if (str[i] == 'Q')
        id = 12;
    else if (str[i] == 'K')
        id = 13;
    else if (str[i]=='1' && ++i)
        id = 10;
    else
        id = str[i] - '0';
    if (str[i+1]=='D')
        id += 14;
    if (str[i+1]=='H')
        id += 28;
    if (str[i+1]=='S')
        id += 42;
    if (p->next[id] == NULL) {
        q = new Trie();
        p->next[id] = q;
        ++nn;
    }
    p = p->next[id];

    return p;
}

void del(Trie *t) {
    if (t == NULL)
        return ;
    for (int i=0; i<TRIEN; ++i)
        del(t->next[i]);
    delete t;
}

int main() {
    int n, m;
    string tmp;
    stack<string> st;
    Trie *r;

    while (scanf("%d", &n)!=EOF && n) {
        root = new Trie();
        nn = 0;
        while (n--) {
            scanf("%d", &m);
            while (m--) {
                cin >> tmp;
                st.push(tmp);
            }
            r = NULL;
            while (!st.empty()) {
                tmp = st.top();
                st.pop();
                if (r == NULL)
                    r = create(tmp.data(), root);
                else
                    r = create(tmp.data(), r);
            }
        }
        printf("%d
", nn);
        del(root);
    }

    return 0;
}