trie学习 HDU1298 T9 trie实现短信的快速编辑
2014-10-08 15:44
323 查看
T9
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)[align=left]Problem Description[/align]
A while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more than nine letters, so most characters could only be
entered by pressing one key several times. For example, if you wanted to type "hello" you had to press key 4 twice, key 3 twice, key 5 three times, again key 5 three times, and finally key 6 three times. This procedure is very tedious and keeps many people
from using the Short Message Service.
This led manufacturers of mobile phones to try and find an easier way to enter text on a mobile phone. The solution they developed is called T9 text input. The "9" in the name means that you can enter almost arbitrary words with just nine keys and without pressing
them more than once per character. The idea of the solution is that you simply start typing the keys without repetition, and the software uses a built-in dictionary to look for the "most probable" word matching the input. For example, to enter "hello" you
simply press keys 4, 3, 5, 5, and 6 once. Of course, this could also be the input for the word "gdjjm", but since this is no sensible English word, it can safely be ignored. By ruling out all other "improbable" solutions and only taking proper English words
into account, this method can speed up writing of short messages considerably. Of course, if the word is not in the dictionary (like a name) then it has to be typed in manually using key repetition again.
Figure 8: The Number-keys of a mobile phone.
More precisely, with every character typed, the phone will show the most probable combination of characters it has found up to that point. Let us assume that the phone knows about the words "idea" and "hello", with "idea" occurring more often. Pressing the
keys 4, 3, 5, 5, and 6, one after the other, the phone offers you "i", "id", then switches to "hel", "hell", and finally shows "hello".
Write an implementation of the T9 text input which offers the most probable character combination after every keystroke. The probability of a character combination is defined to be the sum of the probabilities of all words in the dictionary that begin with
this character combination. For example, if the dictionary contains three words "hell", "hello", and "hellfire", the probability of the character combination "hell" is the sum of the probabilities of these words. If some combinations have the same probability,
your program is to select the first one in alphabetic order. The user should also be able to type the beginning of words. For example, if the word "hello" is in the dictionary, the user can also enter the word "he" by pressing the keys 4 and 3 even if this
word is not listed in the dictionary.
[align=left]Input[/align]
The first line contains the number of scenarios.
Each scenario begins with a line containing the number w of distinct words in the dictionary (0<=w<=1000). These words are given in the next w lines. (They are not guaranteed in ascending alphabetic order, although it's a dictionary.) Every line starts with
the word which is a sequence of lowercase letters from the alphabet without whitespace, followed by a space and an integer p, 1<=p<=100, representing the probability of that word. No word will contain more than 100 letters.
Following the dictionary, there is a line containing a single integer m. Next follow m lines, each consisting of a sequence of at most 100 decimal digits 2-9, followed by a single 1 meaning "next word".
[align=left]Output[/align]
The output for each scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1.
For every number sequence s of the scenario, print one line for every keystroke stored in s, except for the 1 at the end. In this line, print the most probable word prefix defined by the probabilities in the dictionary and the T9 selection rules explained above.
Whenever none of the words in the dictionary match the given number sequence, print "MANUALLY" instead of a prefix.
Terminate the output for every number sequence with a blank line, and print an additional blank line at the end of every scenario.
[align=left]Sample Input[/align]
2
5
hell 3
hello 4
idea 8
next 8
super 3
2
435561
43321
7
another 5
contest 6
follow 3
give 13
integer 6
new 14
program 4
5
77647261
6391
4681
26684371
77771
[align=left]Sample Output[/align]
Scenario #1:
i
id
hel
hell
hello
i
id
ide
idea
Scenario #2:
p
pr
pro
prog
progr
progra
program
n
ne
new
g
in
int
c
co
con
cont
anoth
anothe
another
p
pr
MANUALLY
MANUALLY
[align=left]Source[/align]
Northwestern Europe 2001
代码:
//trie实现短信的快速编辑
//通过用户对一些单词的点击数量,在九宫格格式下,在每次输入字符后,自动寻找当前编辑概率最多的单词,并显示
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
node *next[26];
int id;
node(){
memset(next,0,sizeof(next));
id = 0;
}
}*head;
int f[10][4] = {{},{},{0,1,2},{3,4,5},{6,7,8},{9,10,11},{12,13,14},{15,16,17,18},{19,20,21},{22,23,24,25}};
void build(node *head,char *s,int p){
int length = strlen(s);
for (int i = 0; i < length; i++)
{
int k = s[i]-'a';
if(head->next[k] == NULL)
head->next[k] = new node();
head->next[k]->id += p;
head = head->next[k];
}
}
int maxp = -1;
char ans[105],tmp[105];
void dfs(node *head,char *s,int pos,int len){
if(pos == len){
if(head->id > maxp){
maxp = head->id;
strncpy(ans,tmp,sizeof(tmp));
}
}
int k = s[pos+1]-'0';
int length = (k==7||k==9)?4:3;
for (int i = 0; i < length; i++)
{
int x = f[k][i];
if(head->next[x] == NULL)continue;
tmp[pos+1] = x+'a';
tmp[pos+2] = '\0';
dfs(head->next[x],s,pos+1,len);
}
}
void FREE(node *head){
for(int i=0; i<26; ++i)
if(head->next[i]!=NULL)
FREE(head->next[i]);
delete head;
}
int main(){
int t;
cin>>t;
int n,m,pro;
char tmp[105]={};
char num[105]={};
int cas = 0;
while(t--){
head = new node();
scanf("%d",&n);
for (int i = 0; i < n; i++)
{
scanf("%s %d",tmp,&pro);
build(head,tmp,pro);
}
printf("Scenario #%d:\n",++cas);
scanf("%d",&m);
for (int i = 0; i < m; i++)
{
scanf("%s",num);
int length = strlen(num);
for (int j = 0; j < length; j++)
{
if(num[j] == '1')break;
maxp = -1;
dfs(head,num,-1,j) ;
if(maxp == -1){
puts("MANUALLY");
}else{
puts(ans);
}
}
puts("");
}puts("");
FREE(head);
}
return 0;
}
相关文章推荐
- SWING学习:JTable实现自定义的编辑单元格 (2)
- jquery学习笔记二 实现可编辑的表格
- Android多媒体学习四:实现图像的编辑和合成
- Android开发学习之以CameraAPI方式实现相机功能(一)——快速实现相机
- 简易短信猫接口程序,可快速实现短信猫二次开发
- MVC3学习第七章 排山倒海第三变----利用MVC3实现数据验证以及完成用户数据的编辑
- VS2005.NET2.0学习视频_3_快速实现本地化多语言版的制作
- 基于Grid快速实现CRUD:单元格编辑
- ASP.NET MVC3 快速入门-第九节 实现编辑、删除与明细信息视图 .
- Android学习之1:实现发送短信功能
- ASP.NET MVC3 快速入门-第九节 实现编辑、删除与明细信息视图
- ASP.NET MVC3 快速入门-第九节 实现编辑、删除与明细信息视图
- ASP.NET MVC3 快速入门-第九节 实现编辑、删除与明细信息视图(转)
- 简单快速开发C\S架构程序用最简单的不分层最快的效率达到功能要求的例子程序FrmCommentEdit 编辑评论的功能实现
- 安卓个人学习笔记---BroadcastReceiver实现短信窃听器
- C++学习 - 快速排序,更加优化的实现
- 快速排序 php实现 算法学习
- 快速学习AJAX之三 Ajax实现登陆
- Yii 快速学习教程------master-slave的实现(四)
- ASP.NET MVC3 快速入门-第九节 实现编辑、删除与明细信息视图