| Time Limit: 1000MS | Memory Limit: 10000KB | 64bit IO Format: %I64d & %I64u |
Description
Background
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".
Problem
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.
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".
Problem
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.
Input
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 iven in the next w lines in ascending alphabetic order. 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�, followed by a single 1 meaning "next word".
Each scenario begins with a line containing the number w of distinct words in the dictionary (0<=w<=1000). These words are iven in the next w lines in ascending alphabetic order. 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�, followed by a single 1 meaning "next word".
Output
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.
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.
Sample Input
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
Sample Output
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
题意即模仿T9输入法选出最优单词
1.首先想到字典树，可以通过数字2-9建树，或者通过字母a-z建树，显然如果用数字建树每个节点要存储的东西很多，并且递归求方案数时很不好写，而通过字母建树则方便很多
2.每一次由于新加上了一位数字，所以应该重新求出最佳情况，这里用dfs求最优解的个数，注意字典树的flag值代表这个节点下的所有情况数的总和，包括她自己和他的儿子
3.dfs(to,w,all)的含义是：to是当前应该操的节点作的tot值(节点编号)，w是当前应该处理的字符串中的数字位数，all是现在处理的总位数，all用来判断是否到达终点，到达后把ans和结果比较并更新arr(路径)
#include<iostream>
#include<algorithm>#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
char s[150],t[150];
char tarr[150];
char arr[150];
int ans=-999;
int tot;
int flag[200000];
struct node{int chi[27];
void init()
{
for (int i=0;i<=25;i++)
chi[i]=0;
}
};
int tt;
node tre[150000];
int allinit()
{
tot=0;
memset(flag,0,sizeof(flag));
tre[0].init();
}
int add(char x[])
{
int len=strlen(x);
int now=0;
int tmp;
for (int i=0;i<len;i++)
{
tmp=x[i]-'a';
if (tre[now].chi[tmp]==0)
{
tre[now].chi[tmp]=++tot;
flag[tot]=0;
tre[tot].init();
}
now=tre[now].chi[tmp];
flag[now]+=tt;
}
}
int f;
int t9n[20];
char t9l[20][20];
int dfs(int to,int w,int all)
{
//t[w] is the one to search
if (w==all+1)
{
if (flag[to]>ans)
{
strcpy(arr,tarr);
ans=flag[to];
return 0;
}
}
int num=s[w]-'0';
for (int i=0;i<=t9n[num];i++)
{
if (tre[to].chi[t9l[num][i]-'a']==0)
continue;
tarr[w]=t9l[num][i];
dfs(tre[to].chi[t9l[num][i]-'a'],w+1,all);
}
}
int main()
{
for (int i=1;i<=10;i++)
t9n[i]=2;
t9n[7]=3;
t9n[9]=3;
t9l[2][0]='a';
t9l[2][1]='b';
t9l[2][2]='c';
t9l[3][0]='d';
t9l[3][1]='e';
t9l[3][2]='f';
t9l[4][0]='g';
t9l[4][1]='h';
t9l[4][2]='i';
t9l[5][0]='j';
t9l[5][1]='k';
t9l[5][2]='l';
t9l[6][0]='m';
t9l[6][1]='n';
t9l[6][2]='o';
t9l[7][0]='p';
t9l[7][1]='q';
t9l[7][2]='r';
t9l[7][3]='s';
t9l[8][0]='t';
t9l[8][1]='u';
t9l[8][2]='v';
t9l[9][0]='w';
t9l[9][1]='x';
t9l[9][2]='y';
t9l[9][3]='z';
int n,m;
cin>>n;
for (int sss=1;sss<=n;sss++)
{
scanf("%d",&m);
for (int i=1;i<=m;i++)
{
scanf("%s%d",&t,&tt);
add(t);
}
scanf("%d",&m);
for (int i=1;i<=m;i++)
{
cout<<"Scenario #"<<i<<":"<<endl;
scanf("%s",&s);
int ll=strlen(s);
for (int j=0;j<ll-1;j++)
{
ans=-999;
f=0;
dfs(0,0,j);
if (ans==-999)
{
cout<<"MANUALLY"<<endl;
continue;
}
for (int k=0;k<=j;k++)
cout<<arr[k];
cout<<endl;
}
cout<<endl;
}
}
}
己和他的儿子
3.dfs(to,w,all)的含义是：to是当前应该操的节点
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
