首页 > 代码库 > hdu----（1075）What Are You Talking About（trie之查找）
hdu----（1075）What Are You Talking About（trie之查找）
What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 14107 Accepted Submission(s): 4546
Problem Description
Ignatius is so lucky that he met a Martian yesterday. But he didn‘t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?
Input
The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian‘s language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian‘s language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can‘t find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(‘ ‘), tab(‘\t‘), enter(‘\n‘) and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that‘s also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
Output
In this problem, you have to output the translation of the history book.
Sample Input
STARTfrom fiwohello difhmars riwosfearth fnnvklike fiiwjENDSTARTdifh, i‘m fiwo riwosf.i fiiwj fnnvk!END
Sample Output
hello, i‘m from mars.i like earth!
Hint
Huge input, scanf is recommended.
Author
Ignatius.L
Recommend
就是给定一个火星的文字，然后对应着有地球的翻译，然后给定一段包含有火星文和地球文的文字，要你翻译成为地球文（如果是地球文，这直接输出，反之则翻译成为地球文。）
思路： 其实只需要将火星文做成一颗字典树(而且在每一个单词的末尾，填上一个tail，使其能够进行对应的查找。)，然后对于每一个单词进行一次查找，如果有，则直接翻译，如果没有则直接输出。
代码：
1 /*hdu 1075 字典树写法*/ 2 //#define LOCAL 3 #include<cstdio> 4 #include<cstring> 5 #include<cstdlib> 6 typedef struct node 7 { 8 int id; 9 struct node *child[26];10 }Trie;11 void Insert(char *s,Trie *root,int v)12 {13 Trie *cur=root,*curnew;14 int i,pos;15 for(i=0;s[i]!=‘\0‘;i++){16 pos=s[i]-‘a‘;17 if(cur->child[pos]==NULL)18 {19 curnew= new Trie;20 curnew->id=0;21 for(int j=0;j<26;j++)22 curnew->child[j]=NULL;23 cur->child[pos]=curnew;24 }25 cur=cur->child[pos];26 }27 cur->id=v;28 }29 int query(char *s,Trie *root)30 {31 Trie *cur=root;32 int i,pos;33 for(i=0;s[i]!=‘\0‘;i++){34 pos=s[i]-‘a‘;35 if(cur->child[pos]!=NULL)36 cur=cur->child[pos];37 else return 0; //输出原字符串38 }39 return cur->id;40 }41 char aa[700000][11],bb[11];42 char str[3010];43 int main()44 {45 #ifdef LOCAL46 freopen("test.in","r",stdin);47 #endif48 Trie *root= new Trie ;49 root->id=0;50 int st;51 for(int i=0;i<26;i++)52 root->child[i]=NULL;53 scanf("%s",aa[0]);54 int i=1;55 while(scanf("%s",aa[i]),strcmp(aa[i],"END"))56 {57 scanf("%s",bb);58 Insert(bb,root,i); //对应标号59 i++;60 }61 scanf("%s",aa[0]);62 getchar();63 while(gets(str),strcmp(str,"END"))64 {65 for(st=i=0;str[i]!=‘\0‘;i++)66 {67 if(str[i]<‘a‘||str[i]>‘z‘){68 if(i>st){69 strncpy(aa[0],str+st,i-st);70 aa[0][i-st]=‘\0‘;71 printf("%s",aa[query(aa[0],root)]);72 }73 st=i+1;74 printf("%c",str[i]);75 }76 }77 puts("");78 }79 return 0;80 }
当然可以用map,在这里就不在补充啦！喵喵！O(∩_∩)O哈哈~
hdu----（1075）What Are You Talking About（trie之查找）
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。