What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 10112Accepted Submission(s): 3198
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
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.
在自己大一即将正式结束进入倒计时一周时,写一道当时写不出的Trie来纪念一下自己大一的成长之路。
题意:
Trie的题意都是那么的简单,相信聪明的你一定理解就不再在这里啰嗦了。不理解的细节之处自己看下面的代码吧!!
我的大一我的成长!!!!
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
const int MAX = 3005;
typedef struct TrieNode
{
char str[12];
bool is_world;
TrieNode *next[26];
}TrieNode;
TrieNode *root;
TrieNode *build()
{
TrieNode *p;
p=(TrieNode *)malloc(sizeof(TrieNode));
for(int i=0;i<26;i++)
p->next[i]=NULL;
p->is_world=false;
return p;
}
void save(char *sss,char *stt)
{
int i;
TrieNode *p=root;
for(i=0;i<(int)strlen(stt);i++)
{
if(p->next[stt[i]-'a']==NULL)
p->next[stt[i]-'a']=build();
p=p->next[stt[i]-'a'];
}
strcpy(p->str,sss);
p->is_world=true;
}
void search(char *world)
{
TrieNode *p=root;
bool falg=true;
for(int i=0;i<(int)strlen(world);i++)
{
if(p->next[world[i]-'a']==NULL){
falg=false;
break;
}
p=p->next[world[i]-'a'];
}
if(falg&&p->is_world)
printf("%s",p->str);
else
printf("%s",world);
}
int main()
{
char s[MAX],sss[12],stt[12];
root=build();
scanf("%s",sss);
while(~scanf("%s",sss))
{
if(!strcmp(sss,"END"))break;
scanf("%s",stt);
save(sss,stt);
}
scanf("%s",sss);getchar();
while(1)
{
int i,k=0;
memset(s,'\0',sizeof(s));
memset(stt,'\0',sizeof(stt));
gets(s);
if(!strcmp(s,"END"))break;
for(i=0;i<(int)strlen(s);i++)
{
if(isalpha(s[i]))
stt[k++]=s[i];
else{
if(stt[0]!='\0')
search(stt);
putchar(s[i]);
memset(stt,'\0',sizeof(stt));
k=0;
}
}
printf("\n");
}
return 0;
}