ural 1002 Phone numbers

 

1002. Phone numbers

Time Limit: 2.0 second
Memory Limit: 16 MB

In the present world you frequently meet a lot of call numbers andthey are going to be longer and longer. You need to remember such akind of numbers. One method to do it in an easy way is to assignletters to digits as shown in the following picture:

1 ij 2 abc 3 def 4 gh 5 kl 6 mn 7 prs 8 tuv 9 wxy 0 oqz

This way every word or a group of words can be assigned a uniquenumber, so you can remember words instead of call numbers. It isevident that it has its own charm if it is possible to find somesimple relationship between the word and the person itself. So you canlearn that the call number 941837296 of a chess playing friend ofyours can be read as WHITEPAWN, and the call number 2855304 of yourfavourite teacher is read BULLDOG.

Write a program to find the shortest sequence of words (i.e. onehaving the smallest possible number of words) which corresponds to agiven number and a given list of words. The correspondence isdescribed by the picture above.

Input

Input contains a series of tests. The first line of each test contains the call number, thetranscription of which you have to find. The number consists of atmost 100 digits. The second line contains the total number of thewords in the dictionary (maximum is 50 000). Each of the remaininglines contains one word, which consists of maximally 50 small lettersof the English alphabet. The total size of the input doesn'texceed 300 KB. The last line contains call number −1.

Output

Each line of output contains the shortest sequenceof words which has been found by your program. The words are separatedby single spaces. If there is no solution to the input data, the linecontains text “ No solution.”. If there are more solutions having theminimum number of words, you can choose any single one of them.

Sample

input	output
7325189087 5 it your reality real our 4294967296 5 it your reality real our -1	reality our No solution.

Problem Source: Central European Olympiad in Informatics 1999

每个单词对应到唯一数字串，可以将每个单词转换成数字串，存入哈希表中，最后再将电话号码分段在哈系表中查找。

1.在哈希表中，关键字是数字串，由于要求输出原单词，所以还要保存该数字串对应的原单词，幸好题目不要求按照字典顺序。

2.将电话号码分段然后到哈系表中查找用dp，t[a][b]表示由a开始由b结束([a, b)，半开半闭区间，下同)的串最少能用多少个单词组成，那么t[a][b] = min{t[a][k], [k][b]}(k > a && k <= b)。设n为电话号码长度。可以从t[0][1]...t[n-1][n](段长度为1)开始，求到t[0][n](段长度为n) 假如哈希表查找时间复杂度为O(1)，那么dp时间复杂度为O(n^3)。

#include <cstdio> #include <algorithm> #include <string> #include <cstring> #include <cassert> #include <list> using namespace std; #define TABSIZE 64 #define WORDSIZE 100 struct HashTable { typedef pair<string, string> pastr; typedef list<pastr> lpastr, *plpastr; HashTable(); ~HashTable(); pastr *insert(const pastr &); pastr *locate(const string &); void print(); static int hash(const string &); plpastr tab[TABSIZE]; }; HashTable::HashTable() { fill(tab, tab + TABSIZE, (plpastr)NULL); } HashTable::~HashTable() { for(int i=0; i<TABSIZE; ++i) delete tab[i]; } HashTable::pastr *HashTable::insert(const pastr &val) { int h = HashTable::hash(val.first); if(tab[h] == NULL) tab[h] = new lpastr; assert(tab[h] != NULL); tab[h]->push_front(val); return &(tab[h]->front()); } HashTable::pastr *HashTable::locate(const string &key) { int h = HashTable::hash(key); plpastr p = tab[h]; if(p == NULL) return NULL; lpastr::iterator it = p->begin(); while(it != p->end()) { if(it->first == key) return &(*it); ++it; } return NULL; } void HashTable::print() { for(int i=0; i<TABSIZE; ++i) { printf("======================================/n%d :/n", i); if(tab[i] == NULL) continue; lpastr &li = *tab[i]; lpastr::iterator it = li.begin(); while(it != li.end()) { printf("%s[ %s ]/n", it->first.c_str(), it->second.c_str()); ++it; } printf("**************************************/n"); } } int HashTable::hash(const string &key) { int ret = 0; for(size_t i=0; i<key.size(); ++i) ret = (ret * 10 + (key[i] - '0')) & (TABSIZE - 1); return ((ret >> 1) ^ ret) & (TABSIZE - 1); } char getnumch(char alph) { static char k2n[26] = {'2', '2', '2', '3', '3', '3', '4', '4', '1', '1', '5', '5', '6', '6', '0', '7', '0', '7', '7', '8', '8', '8', '9', '9', '9', '0'}; return k2n[alph - 'a']; } HashTable *ht = NULL; void newword() { assert(ht != NULL); char alph[WORDSIZE + 1]; char num[WORDSIZE + 1]; scanf("%s", alph); *(transform(alph, alph + strlen(alph), num, getnumch)) = '/0'; ht->insert(HashTable::pastr(string(num), string(alph))); } int dp[WORDSIZE + 1][WORDSIZE + 1]; int track[WORDSIZE + 1][WORDSIZE + 1]; void make_dp(char *num) { int len = strlen(num); char t[WORDSIZE + 1] = " "; for(int i=0; i<len; ++i) { t[0] = num[i]; if(ht->locate(string(t)) == NULL) dp[i][i + 1] = 100; else dp[i][i + 1] = 1; } for(int i=2; i<=len; ++i) { for(int j=0; j<=len-i; ++j) { *(copy(num + j, num + j + i, t)) = '/0'; if(ht->locate(string(t)) != NULL) { dp[j][j + i] = 1; track[j][j + i] = j + i; continue; } else dp[j][j + i] = 100; for(int k=j+1; k<j+i; ++k) { if(dp[j][j + i] > dp[j][k] + dp[k][j + i]) { track[j][j + i] = k; dp[j][j + i] = dp[j][k] + dp[k][j + i]; } } } } } void backtrack(int b, int e, char *num) { int len = strlen(num); assert(ht != NULL && dp[0][len] != 100); int k = track[b][e]; if(k == e) { char t[WORDSIZE]; *(copy(num + b, num + e, t)) = '/0'; printf(b==0 ? "%s" : " %s", ht->locate(string(t))->second.c_str()); return; } backtrack(b, k, num); backtrack(k, e, num); if(b == 0) printf("/n"); } int main() { char num[WORDSIZE + 1]; int len, n; while(true) { scanf("%s", num); if(num[0] == '-') break; len = strlen(num); scanf("%d", &n); ht = new HashTable; assert(ht != NULL); while(n-- > 0) newword(); make_dp(num); if(dp[0][len] == 100) printf("No solution./n"); else backtrack(0, len, num); delete ht; } return 0; }