HDU1298 T9
2016-04-01 03:35
411 查看
题目链接:HDU1298
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2457 Accepted Submission(s): 909
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
Sample Output
题意:模拟9宫格的输入法,先给出每个单词的频度,在查询在此时每输入一个数字会返回怎样的结果,返回的字符串是当前频度最高的,注意如果几个单词共享前缀,那么这个前缀的频度是这些单词频度的和。
题目分析:这题2个难点,一是看不懂题,二是给乱七八糟的变量起名字,抛开命名规则不谈,这题主要是在字典树上的深搜,搜索时找长度最长的输出。
嗯,,虽然长但写起来并不困难。
T9
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2457 Accepted Submission(s): 909
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
题意:模拟9宫格的输入法,先给出每个单词的频度,在查询在此时每输入一个数字会返回怎样的结果,返回的字符串是当前频度最高的,注意如果几个单词共享前缀,那么这个前缀的频度是这些单词频度的和。
题目分析:这题2个难点,一是看不懂题,二是给乱七八糟的变量起名字,抛开命名规则不谈,这题主要是在字典树上的深搜,搜索时找长度最长的输出。
// // main.cpp // HDU1298 // // Created by teddywang on 16/3/30. // Copyright © 2016年 teddywang. All rights reserved. // #include <iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; typedef struct node { int flag; int num; node *next[26]; }trienode; trienode *root; char s[1005][120]; int p[10][5]={{0},{0},{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}}; int n,m,l; int flag,maxn; void insert_node(char *s,int num,int f) { trienode *r=root,*t; int len=strlen(s); for(int i=0;i<len;i++) { int buf=s[i]-'a'; if(r->next[buf]==NULL) { t=new node; t->num=num; t->flag=f; for(int j=0;j<26;j++) t->next[j]=NULL; r->next[buf]=t; r=t; } else { r=r->next[buf]; r->num+=num; r->flag=f; } } } void del(trienode*r) { for(int i=0;i<26;i++) { if(r->next[i]!=NULL) del(r->next[i]); } free(r); } void dfs(char *t,int k,int pos,int ans,trienode *r) { if(pos==k) { if(ans>maxn) { maxn=ans; flag=r->flag; } return ; } int buf=t[pos]-'0'; int len=3; if(buf==7||buf==9) len++; for(int i=0;i<len;i++) { int buf2=p[buf][i]; if(r->next[buf2]==NULL) continue; dfs(t,k,pos+1,r->next[buf2]->num,r->next[buf2]); } return ; } int main() { cin>>n; for(int i=1;i<=n;i++) { root=new node; root->num=0; root->flag=-1; for(int j=0;j<26;j++) root->next[j]=NULL; cin>>m; for(int j=0;j<m;j++) { scanf("%s",s[j]); int buf; cin>>buf; char t[120]; strcpy(t,s[j]); insert_node(t,buf,j); } cin>>l; printf("Scenario #%d:\n",i); for(int j=0;j<l;j++) { char t[120]; scanf("%s",t); int len=strlen(t)-1; for(int k=1;k<=len;k++) { maxn=0;flag=-1; dfs(t,k,0,0,root); if(flag==-1) printf("MANUALLY\n"); else { for(int v=0;v<k;v++) printf("%c",s[flag][v]); printf("\n"); } } printf("\n"); } del(root); printf("\n"); } }
嗯,,虽然长但写起来并不困难。
相关文章推荐
- JAVA面试题4
- 经典排序算法(Java版)
- MySQL Command 常见命令
- 20070929迅雷面试部分题
- 华为的JAVA面试题及答案(部分)
- hdu 2521(反素数)
- 【Leetcode】Reverse Words in a String II
- 2009年浙江大学计算机及软件工程研究生机试真题
- 93. Restore IP Addresses
- shader实例(二十)法线贴图实现凹凸效果
- fallocate和reflink
- 2008年浙江大学计算机及软件工程研究生机试真题
- Using VS2015 64-bit compiler to build up igllib
- ScalaTest测试框架
- Java Timer 后门
- 屏幕水幕特效
- 2007年浙江大学计算机及软件工程研究生机试真题
- 2007年浙江大学计算机及软件工程研究生机试真题
- UCloud上LNMP小型网站搭建
- Server配置加png后缀解析并藏png一句话到最深目录