首页 > 代码库 > hdu1075What Are You Talking About (字典树)

hdu1075What Are You Talking About (字典树)

2024-07-13 17:19:13   220人阅读

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, andjust 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.
[/hint]
#include<stdio.h>
#include<string.h>
#include<malloc.h>
typedef struct nnn
{
    int flag;
    char *traslat;
    struct nnn *next[26];
}node;
node *builde()
{
    node *p=(node*)malloc(sizeof(node));
    p->flag=0;
    for(int i=0;i<26;i++)
    p->next[i]=NULL;
    return p;
}
node *root;
void insert(char str[],char tras[])
{
    node *p=root;
    for(int i=0;str[i]!='\0';i++)
    {
        if(p->next[str[i]-'a']==NULL)
        p->next[str[i]-'a']=builde();
        p=p->next[str[i]-'a'];
    }
    p->flag=1;
    int len=strlen(tras)+1;
    p->traslat=(char*)malloc(len*sizeof(char));
    strcpy(p->traslat,tras);
}
void trasl(char str[])
{
    node *p=root;
    for(int i=0;str[i]!='\0';i++)
    {
        if(p->next[str[i]-'a']==NULL)
        {
            printf("%s",str); return ;
        }
        p=p->next[str[i]-'a'];
    }
    if(p->flag)
    printf("%s",p->traslat);
    else
    printf("%s",str);
}
int main()
{
    char tras[15],str[3005],str1[15];
    root=builde();
    while(scanf("%s",tras)>0&&strcmp(tras,"END")!=0)
    {
        if(strcmp("START",tras)==0)continue;
        scanf("%s",str);
        insert(str,tras);
    }
    getchar();
    while(gets(str),strcmp(str,"END")!=0)
    {
        if(strcmp("START",str)==0)continue;
        int len=strlen(str);
        for(int i=0,j=0;i<=len; i++)
        {
            if(str[i]>='a'&&str[i]<='z')
                str1[j++]=str[i];
            else
            {
                str1[j]='\0';
                if(j) trasl(str1);
                if(i==len||str[i]=='\n')printf("\n");
                else if(str[i]=='\t') printf("\t");
                else printf("%c",str[i]);
                j=0;
            }
        }
    }
}


hdu1075What Are You Talking About (字典树)


联系
我们