hdu 4287 Intelligent IME
来源:互联网 发布:中南大学现代网络平台 编辑:程序博客网 时间:2024/05/24 06:33
Intelligent IME
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3487 Accepted Submission(s): 1659
Problem Description
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?
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.
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.
Sample Input
13 5466444874goinnightmightgn
Sample Output
320
Source
2012 ACM/ICPC Asia Regional Tianjin Online
题解:因为字符串最长为6,所以直接翻译所给的字符串,记录翻译值得个数再查询即可。
#include<cstring>#include<algorithm>#include<iostream>#include<cstdio>#define N 5005using namespace std;int n,m;int a[140];int b[N];void init() { int x=2; for(int i='a'; i<='o'; i+=3) { for(int j=i; j<i+3; j++) a[j]=x; x++; } a['p']=a['q']=a['r']=a['s']=7; a['t']=a['u']=a['v']=8; a['w']=a['x']=a['y']=a['z']=9;}int num[1000100];int main() { // freopen("test.in","r",stdin); int t; init(); cin>>t; while(t--) { scanf("%d%d",&n,&m); for(int i=0; i<n; i++)scanf("%d",&b[i]); memset(num,0,sizeof(num)); while(m--) { char s[20]; scanf("%s",s); int sum=0; for(int i=0; s[i]; i++) sum=sum*10+a[s[i]]; num[sum]++; } for(int i=0; i<n; i++) { printf("%d\n",num[b[i]]); } } return 0;}
0 0
- hdu 4287 Intelligent IME
- HDU-4287-Intelligent IME
- HDU 4287 Intelligent IME
- hdu 4287 Intelligent IME
- Intelligent IME hdu 4287
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- hdu-4287 Intelligent IME
- hdu 4287 Intelligent IME
- HDU 4287 - Intelligent IME
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- hdu 4287 Intelligent IME
- hdu 4287 Intelligent IME
- hdu-4287 Intelligent IME
- hdu 4287 Intelligent IME
- HDU 4287 Intelligent IME
- 检索树算法
- ExtJS 的一些使用总结(适用于3.x版本)
- ATM机项目演示
- Cookie详解
- HDU-2112 HDU Today(最短路[Dijkstra])
- hdu 4287 Intelligent IME
- 2015-08-10-----2015-08-11
- 数据结构之---C语言实现最小生成树之prim(普里姆)算法
- 希尔排序(简单)
- ListView item过多 造成视图超出界面 解决
- 黑马程序员
- 学生管理系统项目演示
- Python学习(一)——随机数
- 使用scrollto实现slidemenu