【POJ】1816 Wild Words

DFS+字典树。题目数据很BT。注意控制DFS深度小于等于len。当'\0'时，还需判断末尾*。另外，当遇到*时，注意讨论情况。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <vector>
 #include <algorithm>
 using namespace std;

 #define TRIEN 28

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

 Trie root;
 char buf[];
 int nums[], nn, len;

 void create(char str[], int in) {
     int i = , id;
     Trie *p = &root, *q;

     while (str[i]) {
         if (str[i] == '?')
             id = ;
         else if (str[i] == '*')
             id = ;
         else
             id = str[i] - 'a';
         ++i;
         if (p->next[id] == NULL) {
             q = new Trie();
             p->next[id] = q;
         }
         p = p->next[id];
     }
     p->vc.push_back(in);
 }

 void find(Trie *p, int d, int f) {
     int id;
     if (d > len)
         return ;
     if (buf[d] == '\0') {
         int vcn = p->vc.size();
         int i;
         if (vcn) {
             for (i=; i<vcn; ++i)
                 nums[nn++] = p->vc[i];
         }
         if (p->next[])
             find(p->next[], d, );
         return ;
     }

     id = buf[d] - 'a';
     if (p->next[id])
         find(p->next[id], d+, );
     if (p->next[])
         find(p->next[], d+, );
     if (p->next[]) {
         find(p->next[], d+, );
         find(p->next[], d, );
     }
     if (f)
         find(p, d+, );
 }

 int main() {
     int n, m, i;

     scanf("%d %d", &n, &m);

     for (i=; i<n; ++i) {
         scanf("%s", buf);
         create(buf, i);
     }

     while (m--) {
         scanf("%s", buf);
         nn = ;
         len = strlen(buf);
         find(&root, , );
         if (!nn) {
             printf("Not match\n");
             continue;
         }
         sort(nums, nums+nn);
         printf("%d", nums[]);
         for (i=; i<nn; ++i)
             if (nums[i] != nums[i-])
                 printf(" %d", nums[i]);
         printf("\n");
     }

     return ;
 }