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;
}

HDU -4287 Intelligent IME 字典树数组模拟相关推荐

[ACM] hdu 1671 Phone List (字典树）
[ACM] hdu 1671 Phone List (字典树) Phone List Problem Description Given a list of phone numbers, determ ...
hdu 1298 字典树 + DFS (模拟T9文本输入)
题意: 给你一些按键顺序,让你输出每一步中概率最大的那个单词,这里的概率计算方法好好看看别弄错了,一开始就是因为弄错了,各种wa,比如 abc 1 ,ab 1,那么 ab 的概率就是2 ...
HDU - 1251 统计难题(字典树)
题目链接:点击查看题目大意:给出一些单词,后续再给出一些前缀,询问包含此前缀的单词一共有多少个题目分析:这个题目的数据可能有点水,而且时间给的也很足,给了两秒,而且加上是hdu的,可以用无序map ...
HDU - 4825 Xor Sum(字典树)
题目链接:点击查看题目大意:给出n个数组成的数组,再给出m个询问,每次询问给出一个x,要求从数组中选出一个k,使得k^x的值最大题目分析:字典树求异或值最大的模板题,对于n个数直接insert到字 ...
CodeForces - 979D Kuro and GCD and XOR and SUM(字典树+暴力+模拟)
题目链接:点击查看题目大意:说实话看到这么复杂而且还是英文的题面我是拒绝的,但题还是得补啊,就去百度找的题解看题意,题意大概是这样的: 给出n个操作,每个操作分为两种类型: 1 x:向集合中插入x ...
hdu 1251 统计难题 (字典树入门题）
1 /******************************************************* 2 题目: 统计难题 (hdu 1251) 3 链接: http://acm.hd ...
字典树-数组指针实现+数组实现
提出问题给定一个字符串集合W,然后询问该集合中是否存在字符串S. eg:W={"acd","bcd","abcd","abcde ...
2019 杭电多校 HDU - 6625 three arrays 字典树+贪心
题目链接:https://cn.vjudge.net/problem/HDU-6625 题意:a和b两个数组n个数,数字任意组合异或,求得到c数组的字典序最小题解:对于两个数组从高位到低位建立两个字 ...
HDU 1251 统计难题字典树/STL
统计难题 Time Limit:2000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64u Description Ig ...

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

HDU -4287 Intelligent IME 字典树数组模拟相关推荐

最新文章

热门文章