hdu4287 Intelligent IME STLmap散列查找
来源:互联网 发布:淘宝上传图片最佳尺寸 编辑:程序博客网 时间:2024/05/23 02:03
Intelligent IME
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4309 Accepted Submission(s): 2018
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
32
#include <cstdio>#include <cstring>#include <iostream>#include <map>#define PAUSE system("pause")using namespace std;const int maxn = 5000 + 10;int N, M, a[maxn], b[30];char s[15];//将a - z所有字母和数字的映射关系打表void init() {int k, num;for (k = 0, num = 2; k < 15; k += 3) {for (int i = k; i < k + 3; i++) {b[i] = num;}num++;}for (; k < 19; k++) {b[k] = num;}num++;for (; k < 22; k++) {b[k] = num;}num++;for (; k < 26; k++) {b[k] = num;}#if 0for (int i = 0; i < 26; i++) {printf("%d ", b[i]);}PAUSE;#endif}int main(){int T;scanf("%d", &T);init();while (T--) {map<int, int> m;scanf("%d%d", &N, &M);for (int i = 0; i < N; i++) {scanf("%d", &a[i]);}for (int j = 0; j < M; j++) {scanf("%s", s);int n = 0;for (int i = 0; s[i]; i++) {n *= 10;n += b[s[i] - 'a'];}m[n]++;}for (int i = 0; i < N; i++) {printf("%d\n", m[a[i]]);}}return 0;}
0 0
- hdu4287 Intelligent IME STLmap散列查找
- 【STL】 hdu4287 Intelligent IME
- HDU4287:Intelligent IME
- HDU4287- Intelligent IME
- hdu4287 Intelligent IME
- hdu4287 Intelligent IME--哈希表
- Trie树 hdu4287 Intelligent IME
- hdu4287 Intelligent IME-字典树
- hdu4287 Intelligent IME (字典树)
- hdu4287 Intelligent IME(字典树)
- hdu4287 Intelligent IME-----天津网络赛
- HDU4287 Intelligent IME(Trie树,map)
- Intelligent IME
- Intelligent IME
- Intelligent IME
- hdu 4287 Intelligent IME
- HDU-4287-Intelligent IME
- HDU 4287 Intelligent IME
- 循环队列的综合操作(出入队、获取队长度)C语言实现
- C# structures 0011
- DES 算法
- Codeforces 608B Hamming Distance Sum
- centos_security.txt - 2016-04-19 23:00
- hdu4287 Intelligent IME STLmap散列查找
- 感觉自己差的好远啊
- 矩阵--原地转置--面试题
- Android基础:获取手机联系人工具类
- C经典 使用递归求x的y次方
- Android如何防止apk程序被反编译
- c++map基本操作
- 笔记:配置父Activity
- 通过adb从手机中导出安装包或导入