(字典树应用) poj 1451 T9

T9

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 1809		Accepted: 692

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.

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".

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.

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
/*
题目大意：构建一个手机词典并记录单词使用的概率,然后用户按手机键盘上面的数字键.要求用户每按一个数字键，手机弹出可能性最大的单词.
题目求解：用字典序构造手机词典，并累计每一个单词前缀串出现的概率. 然后创建数字和字母的映射表(1-3)，计算所有可能前缀串的概率值，
		：并输出其中的概率最大的字符串,否则输出MANUALLY.
代码技巧：队列存储每个数字产生的所有前缀串,用str+'c'来叠加产生新的字符串
Source Code

Problem: 1451  User: wawadimu 
Memory: 588K  Time: 32MS 
Language: C++  Result: Accepted 

Source Code 
*/
#include <iostream>
#include<string>
#include<queue>
using namespace std;

//26个字母的字典树
struct node
{
    int num;
    struct node* next[26];
    node()
    {
        num=0;
        for(int i=0;i<26;i++)
        next[i]=NULL;
    }
};

node *root;//根节点
//用已有词库构造字典树
void insert(const char *str,int v)
{
    if(root==NULL)
    root=new node();
    node *p=root;

    while(*str)
    {
        int index=(*str)-'a';
        *str++;
        if(p->next[index]==NULL)//不存在这个字母的前缀，分支
        {
            p->next[index]=new node();
        }
        p=p->next[index];
        p->num+=v;//累计这个前缀串出现的概率值
    }
}
int search(const char *str)
{
    node *p=root;
    while( p && (*str))
    {
        int index=(*str)-'a';
        *str++;
        p=p->next[index];
    }
    if(!p) return 0;//未找到这个词前缀串
    return p->num;//返回这个前缀串的概率.
}
const char key[27]={"22233344455566677778889999"};//映射键盘对应的str-'a'的ASII值
char s[102],t[102];//s词库串,t查找串
int main()
{
    //freopen("1451.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    int Case,n,i,j,k,p,len;
    char c;
    scanf("%d",&Case);
    for(i=1;i<=Case;i++)
    {
        printf("Scenario #%d:/n",i);
        root=new node();
        scanf("%d",&n);
        while(n--)//插入所有词库
        {
            scanf("%s%d",s,&p);
            insert(s,p);
        }
        scanf("%d",&n);
        while(n--)//n个查找串
        {
            scanf("%s",t);
            queue<string> q;
            string lls,str;
            str="";
            q.push(str);
            for(k=0;t[k]!='1';k++)//前缀串
            {
                str="";
                c=t[k];
                int num,max=0;//num返回可能前缀串的概率,max返回所有可能串的最大概率值
                len=q.size();
                while(len--)//上一个字串产生的所有串
                {
                    string sub=q.front();
                    q.pop();
                    for(j=0;j<26;j++)
                    {
                        if(c==key[j])//每一个数字可能对应三个字母
                        {
                            lls=sub+char('a'+j);//产生新字串
                            num=search(lls.c_str());
                            if(max<num)//找每一个可能的前缀串的最大概率
                            {
                                max=num;
                                str=lls;
                            }
                            if(num!=0) q.push(lls);//词库中不包含这个字串或词库
                        }
                        else if(c<key[j]) break;//三个字母全部计算过，退出循环
                    }

                }
                if(max)
					printf("%s/n",str.c_str());
                else//没有字串前缀，直接全部打印MANUALLY,去读取下一个字符串
                {
                    while(t[k]!='1')
                    {
                        k++;
                        printf("MANUALLY/n");
                    }
                    break;
                }
            }
            printf("/n");
        }
        printf("/n");
    }
    return 1;
}