集训队专题（1）1009 T9

T9

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 35   Accepted Submission(s) : 13

Problem Description

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.

 

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

 

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

  
  

 

Source

Northwestern Europe 2001

 

       此题比较复杂，不仅考验读题的耐心（小编我也是个英语渣TT），还对大家字典树的灵活运用来说是个挑战。

       题目大意：（小编自己的理解……若是不对，请原谅小编是个英语渣TT）在以前，手机是九宫输入法（小编表示不会用九宫输入），一个键包含了很多个字母，为了打出一个字母就需要按几次键，比如5上有“JKL”，要打“K”就要按两次5（这么麻烦……），所以一家公司发明了T9技术输入法。这种输入法内置这很多英语单词，它可以根据英语出现的频率，是否存在等信息，每个字母只要按一次，就可以有想要的预选单词。 （有点类似于我们用过的搜狗输入法）例如，假设输入法只内置了一个单词“hell”， 那么只需要按4355便可以出来。 注意，如果有一个单词hell， 那么这个单词的所有前缀，h, he, hel, 也当作是存在的。

       分析：首先需要在定义结构体的同时也加上一个int变量来存储出现次数。然后便开始建立树，在建立好树之后，从根节点出发，对树进行深度优先搜索（DFS），找到出现频率最大的节点，再输出即可。还有为了不爆内存，记得最后对节点的消除。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef struct dicTNode
{//构造字典树节点
    struct dicTNode *child[26];
    int cnt;
}dicTNode, *dicTree;
typedef char word[102];
char dig2char[][5] = {"", "", "abc", "def", 
                        "ghi", "jkl", "mno", 
                        "pqrs", "tuv","wxyz"};
char digit[102];
word rr;
int maxv;
void init(dicTree &root)
{
    root = new dicTNode;
    root->cnt = 0;
    for(int i = 0; i < 26; i++)
        root->child[i] = NULL;
}
void insert(dicTree &root, word str, int n)
{
    dicTree current, newnode;
    int len = strlen(str), i, j;
    current = root;
    for(i = 0; i < len; i++)
    {
        if(current->child[str[i] - 'a'])
        {
            current = current->child[str[i] - 'a'];
            current->cnt += n;
        }
        else
        {
            newnode = new dicTNode;
            for(j = 0; j < 26; j++)
                newnode->child[j] = NULL;
            newnode->cnt = n;
            current->child[str[i] - 'a'] = newnode;
            current = current->child[str[i] - 'a'];
        }
    }
}
int find(word str, dicTree root)   
{   
    int i,len, minv = -1;   
    dicTree current;
    len = strlen(str);
    if(len==0) return 0; 
    current=root; 
    for(i=0;i<len;i++)   
    {   
        if(current->child[str[i]-'a']!=0)   
        {
            current=current->child[str[i]-'a'];  
            if(current->cnt <= maxv)
                return -1;
        }
        else return 0;   
    }   
    return current->cnt;   
}  
void dfs(int ss, int kk, word &result, dicTree root)
{  
    int tmax;
    if(ss > kk)
    {
        result[ss] = '\0';
        tmax = find(result, root);
        if(tmax > maxv)
        {
            strcpy(rr, result);
            maxv = tmax;
        }
    }
    else
    {
        int cc = digit[ss] - '0';
        int len = strlen(dig2char[cc]);
        for(int i = 0;i < len; i++)
        {
            result[ss] = dig2char[cc][i];
            result[ss + 1] = '\0';
            if(find(result, root) <= maxv)
                continue;
            dfs(ss + 1, kk, result, root);
        }
    }
}
void destoryBydfs(dicTree &root)
{
    if(root)
    {
        for(int i = 0; i < 26; i++)
            destoryBydfs(root->child[i]);
    }
    free(root);
    root = NULL;
}
int main()
{
    dicTree root;
    word str, result;
    int T, n, w, len;
    int i;
    cin>>T;
    for(int k = 1; k <= T; k++)
    { 
        cin>>w;
        //此部分为建字典树部分
        init(root);
        while(w--)
        {
            cin>>str>>n;
            insert(root, str, n);
        }
        cin>>w;
        cout<<"Scenario #"<<k<<":"<<endl;
        while(w--)
        {
            cin>>digit;
            len = strlen(digit) - 1;
            for(i = 0; i < len; i++)
            {
                strcpy(rr, "");
                maxv = 0;
                dfs(0, i, result, root );
                if(maxv == 0)
                    cout<<"MANUALLY"<<endl;
                else
                    cout<<rr<<endl;
            }
            cout<<endl;
        }
        destoryBydfs(root);//销毁字典树
            cout<<endl;
    }
    return 0;
}