Time Limit : 10000/5000ms (Java/Other) Memory Limit : 102400/204800K (Java/Other)
Total Submission(s) : 13 Accepted Submission(s) : 8
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
Output
In this problem, you have to output the translation of the history book.
Sample Input
START from fiwo hello difh mars riwosf earth fnnvk like fiiwj END START difh, 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
该代码存在问题,如果只输入 r 这个字符,则问题就出来了
#include<iostream> #include<cstdio> #include<cstring> using namespace std; struct Trie{ char wrd[20]; int flag; Trie *next[26]; Trie(){ for(int i=0;i<26;i++) next[i]=NULL; flag=0; } }; Trie *root; char s[3100]; void InsertTrie(char *str,char *wrd){ Trie *loc=root,*tmp; for(int i=0;str[i]!='\0';i++){ int id=str[i]-'a'; if(loc->next[id]==NULL){ tmp=new Trie(); loc->next[id]=tmp; } loc=loc->next[id]; } loc->flag=1; strcpy(loc->wrd,wrd); } int SearchTrie(char *str,char *wrd){ Trie *loc=root; for(int i=0;str[i]!='\0';i++){ int id=str[i]-'a'; if(loc->next[id]!=NULL) loc=loc->next[id]; else return 0; } if(loc->flag){ strcpy(wrd,loc->wrd); return 1; } return 0; } void release(Trie *rt){ if(rt==NULL) return ; for(int i=0;i<26;i++) if(rt->next[i]!=NULL) release(rt->next[i]); delete rt; rt=NULL; } int main(){ //freopen("input.txt","r",stdin); root=new Trie(); char str[20],wrd[20]; gets(s); while(gets(s) && s[0]!='E'){ sscanf(s,"%s%s",wrd,str); InsertTrie(str,wrd); } gets(s); int cnt,len; while(gets(s) && s[0]!='E'){ len=strlen(s); cnt=0; for(int i=0;i<len;i++){ if(s[i]>='a' && s[i]<='z') str[cnt++]=s[i]; else{ str[cnt]='\0'; if(cnt>0){ if(SearchTrie(str,wrd)) printf("%s",wrd); else printf("%s",str); } printf("%c",s[i]); cnt=0; } } str[cnt]='\0'; if(cnt>0){ if(SearchTrie(str,wrd)) printf("%s",wrd); else printf("%s",str); } printf("\n"); } //release(root); 空间够用就别加,还浪费时间 return 0; }