HDU -4287 Intelligent IME 字典树数组模拟

　We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respectively, as shown below: 
　　2 : a, b, c    3 : d, e, f    4 : g, h, i    5 : j, k, l    6 : m, n, o     
　　7 : p, q, r, s  8 : t, u, v    9 : w, x, y, z 
　　When we want to input the word “wing”, we press the button 9, 4, 6, 4, then the input method will choose from an embedded dictionary, all words matching the input number sequence, such as “wing”, “whoi”, “zhog”. Here comes our question, given a dictionary, how many words in it match some input number sequences? 

Input

　　First is an integer T, indicating the number of test cases. Then T block follows, each of which is formatted like this: 
　　Two integer N (1 <= N <= 5000), M (1 <= M <= 5000), indicating the number of input number sequences and the number of words in the dictionary, respectively. Then comes N lines, each line contains a number sequence, consisting of no more than 6 digits. Then comes M lines, each line contains a letter string, consisting of no more than 6 lower letters. It is guaranteed that there are neither duplicated number sequences nor duplicated words. 

Output

　　For each input block, output N integers, indicating how many words in the dictionary match the corresponding number sequence, each integer per line. 

文章大意：手机键盘中与数字2相对应的字母有a,b,c；3相对应的字母有d，e，f。给出一些数字串如34，和一些小写字母串。求小写字母对应的数字串出现的次数。字符串abc对应的数字串是111，dh对应的数字串是34。则小写字符串中111出现一次，34出现一次。

 自己跳进的坑：因为是T组输入，所以也要给tree数组清零，emmmm。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[10];int cnt[500005];
int tree[500003][12],sum[500003];
char s[15];
int tot,len,rt;
void init()
{
    memset(sum,0,sizeof(sum));
    memset(cnt,0,sizeof(cnt));
    memset(tree,0,sizeof(tree));
    tot=0;
}
int Getnum(char ch)
{
    if(ch>='a'&&ch<='c')
        return 2;
   else if(ch>='d'&&ch<='f')
        return 3;
   else if(ch>='g'&&ch<='i')
        return 4;
   else if(ch>='j'&&ch<='l')
        return 5;
   else if(ch>='m'&&ch<='o')
        return 6;
    else if(ch>='p'&&ch<='s')
        return 7;
    else if(ch>='t'&&ch<='v')
        return 8;
    else
        return 9;
}
void insert(int v)
{
    len=strlen(s);
    rt=0;
    for(int i=0;i<len;i++)
    {
        int id=s[i]-'0';
        if(!tree[rt][id])
        {
          // memset(tree[tot],0,sizeof(tree[tot]));
          //   sum[rt]=0;
             tree[rt][id]=++tot;
        }

        rt=tree[rt][id];
    }
    sum[rt]=v;
   // printf("%d#\n",sum[rt]);
}
int Find(char *s)
{
    rt=0;
    len=strlen(s);
    for(int i=0;i<len;i++)
    {
        int id=Getnum(s[i]);
       // printf("%d**\n",id);
        if(!tree[rt][id])
            return 0;
        rt=tree[rt][id];
    }
   // printf("#%d\n",sum[rt]);
    return sum[rt];
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        init();
        //memset(cnt,0,sizeof(cnt));
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%s",s);
            insert(i);
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%s",s);
            cnt[Find(s)]++;
        }
        for(int i=1;i<=n;i++)
            printf("%d\n",cnt[i]);
    }
    return 0;
}