http://acm.hdu.edu.cn/showproblem.php?pid=1075
What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 14675 Accepted Submission(s): 4720
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!HintHuge input, scanf is recommended.
#include<stdio.h>
#include<string.h>
#include<malloc.h>
#define change(n) (n-('a'-0))//把字母变成0~25
#define NUM 26
#define MAX 3000//句子包含的字符长度
struct Trie
{
bool judge;//到该节点是否有单词
char s[20];//如果该节点有词,存放该词
struct Trie *next[NUM];
};
void Build(struct Trie *root,char *c,char *s)
{
int i,j,k,n,m;
n=strlen(s);
struct Trie *p=root;
for(i=0;i<n;i++)
{
m=change(s[i]);
if(p->next[m])
{
p=p->next[m];
continue;
}
//-----创建新节点-----//
struct Trie *s;
s=(struct Trie *)malloc(sizeof(struct Trie));
s->judge=false;
for(j=0;j<NUM;j++)
s->next[j]=NULL;
//--------------------//
p->next[m]=s;
p=p->next[m];
}
strcpy(p->s,c);
p->judge=true;
}
void Find(struct Trie *root,char *s)
{
int i,j,k,n,m;
bool t=false;
n=strlen(s);
struct Trie *p=root;
for(i=0;i<n;i++)
{
m=change(s[i]);
if(!(p->next[m])) break;
if(p->next[m])
p=p->next[m];
}
if(p->judge&&i==n)
{
memset(s,'\0',sizeof(s));
strcpy(s,p->s);
}
}
void Delete(struct Trie *root)
{
int i;
for(i=0;i<NUM;i++)
{
if(root->next[i])
Delete(root->next[i]);
}
free(root);
}
int main()
{
char c[20],s[20];
int i,j,k;
//-----建立根节点-----//
struct Trie *head;
head=(struct Trie *)malloc(sizeof(struct Trie));
head->judge=false;
for(i=0;i<NUM;i++)
head->next[i]=NULL;
//--------------------//
while(scanf("%s",c)&&strcmp(c,"END")!=0)
{
if(strcmp(c,"START")==0) continue;
else
scanf("%s",s);
Build(head,c,s);
}//建立Trie树成功
getchar();
char list[MAX+10]/*要翻译的句子*/,last[MAX+10];
int n;
while(gets(list))
{
n=strlen(list);
if(strcmp(list,"START")==0) continue;
else if(strcmp(list,"END")==0) break;
memset(last,'\0',sizeof(last));
for(i=0,j=0;i<n;)
{
if(!(list[i]>='a'&&list[i]<='z'))
{
last[j]=list[i];
i+=1;j+=1;
continue;
}
char need[20];//暂时需要
for(k=0;list[i]>='a'&&list[i]<='z';i++,k++)
need[k]=list[i];
need[k]='\0';
Find(head,need);//在Trie查找是否有need
strcat(last,need);
j+=strlen(need);
}
puts(last);
}
Delete(head);//释放内存
return 0;
}